YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:30:08,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:30:08,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:30:08,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:30:08,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:30:08,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:30:08,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:30:08,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:30:08,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:30:08,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:30:08,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:30:08,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:30:08,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:30:08,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:30:08,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:30:08,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:30:08,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:30:08,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:30:08,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:30:08,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:30:08,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:30:08,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:30:08,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:30:08,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:30:08,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:30:08,137 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:30:08,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:30:08,138 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:30:08,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:30:08,139 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:30:08,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:30:08,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:30:08,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:30:08,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:30:08,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:30:08,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:30:08,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:30:08,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:30:08,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:30:08,144 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:30:08,159 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:30:08,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:30:08,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:30:08,160 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:30:08,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:30:08,161 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:30:08,161 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:30:08,161 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:30:08,161 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:30:08,161 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:30:08,161 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:30:08,162 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:30:08,162 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:30:08,162 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:30:08,162 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:30:08,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:30:08,162 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:30:08,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:30:08,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:30:08,163 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:30:08,163 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:30:08,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:30:08,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:30:08,164 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:30:08,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:30:08,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:30:08,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:30:08,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:30:08,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:30:08,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:30:08,202 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:30:08,205 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:30:08,207 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:30:08,207 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:30:08,208 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:30:08,305 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/53ddae3cd07f41bca0b895f106587cff/FLAGb33bf140a [2020-06-22 10:30:08,648 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:30:08,649 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:30:08,649 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:30:08,655 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/53ddae3cd07f41bca0b895f106587cff/FLAGb33bf140a [2020-06-22 10:30:09,055 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/53ddae3cd07f41bca0b895f106587cff [2020-06-22 10:30:09,066 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:30:09,068 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:30:09,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:30:09,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:30:09,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:30:09,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f30509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09, skipping insertion in model container [2020-06-22 10:30:09,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:30:09,101 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:30:09,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:30:09,271 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:30:09,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:30:09,359 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:30:09,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09 WrapperNode [2020-06-22 10:30:09,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:30:09,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:30:09,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:30:09,361 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:30:09,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:30:09,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:30:09,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:30:09,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:30:09,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:30:09,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:30:09,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:30:09,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:30:09,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:30:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:30:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:30:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:30:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:30:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:30:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:30:09,779 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:30:09,779 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 10:30:09,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:30:09 BoogieIcfgContainer [2020-06-22 10:30:09,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:30:09,781 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:30:09,781 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:30:09,783 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:30:09,784 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:30:09" (1/1) ... [2020-06-22 10:30:09,803 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 65 edges [2020-06-22 10:30:09,805 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:30:09,806 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:30:09,806 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:30:09,807 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:30:09,808 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:30:09,809 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:30:09,809 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:30:09,840 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:30:09,875 INFO L200 BlockEncoder]: SBE split 31 edges [2020-06-22 10:30:09,880 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 10:30:09,881 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:30:09,908 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:30:09,911 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:30:09,913 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:30:09,913 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:30:09,913 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:30:09,914 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:30:09,915 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 88 edges [2020-06-22 10:30:09,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:30:09 BasicIcfg [2020-06-22 10:30:09,915 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:30:09,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:30:09,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:30:09,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:30:09,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:30:09" (1/4) ... [2020-06-22 10:30:09,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588ab252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:30:09, skipping insertion in model container [2020-06-22 10:30:09,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (2/4) ... [2020-06-22 10:30:09,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588ab252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:30:09, skipping insertion in model container [2020-06-22 10:30:09,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:30:09" (3/4) ... [2020-06-22 10:30:09,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588ab252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:30:09, skipping insertion in model container [2020-06-22 10:30:09,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:30:09" (4/4) ... [2020-06-22 10:30:09,924 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:30:09,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:30:09,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-06-22 10:30:09,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-06-22 10:30:09,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:30:09,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:30:09,990 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:30:09,990 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:30:09,990 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:30:09,990 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:30:09,991 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:30:09,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:30:09,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:30:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-06-22 10:30:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:30:10,013 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:30:10,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:30:10,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 10:30:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 163082, now seen corresponding path program 1 times [2020-06-22 10:30:10,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:10,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:30:10,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:30:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,227 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 10:30:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:10,407 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. [2020-06-22 10:30:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:10,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:30:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:30:10,422 INFO L225 Difference]: With dead ends: 51 [2020-06-22 10:30:10,423 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 10:30:10,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 10:30:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 10:30:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 10:30:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. [2020-06-22 10:30:10,467 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 3 [2020-06-22 10:30:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:30:10,468 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 74 transitions. [2020-06-22 10:30:10,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:30:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 74 transitions. [2020-06-22 10:30:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:30:10,469 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:30:10,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:30:10,469 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 10:30:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 163079, now seen corresponding path program 1 times [2020-06-22 10:30:10,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:10,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:10,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:30:10,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:30:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,500 INFO L87 Difference]: Start difference. First operand 44 states and 74 transitions. Second operand 3 states. [2020-06-22 10:30:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:10,623 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2020-06-22 10:30:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:10,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:30:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:30:10,625 INFO L225 Difference]: With dead ends: 44 [2020-06-22 10:30:10,625 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 10:30:10,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 10:30:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-06-22 10:30:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 10:30:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2020-06-22 10:30:10,632 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 3 [2020-06-22 10:30:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:30:10,632 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 60 transitions. [2020-06-22 10:30:10,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:30:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2020-06-22 10:30:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:30:10,633 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:30:10,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:30:10,633 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 10:30:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 5053643, now seen corresponding path program 1 times [2020-06-22 10:30:10,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:10,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:10,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:10,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:10,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:10,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:30:10,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:30:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,663 INFO L87 Difference]: Start difference. First operand 37 states and 60 transitions. Second operand 3 states. [2020-06-22 10:30:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:10,743 INFO L93 Difference]: Finished difference Result 37 states and 60 transitions. [2020-06-22 10:30:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:10,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:30:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:30:10,745 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:30:10,745 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:30:10,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:30:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 10:30:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:30:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2020-06-22 10:30:10,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 4 [2020-06-22 10:30:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:30:10,767 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-06-22 10:30:10,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:30:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2020-06-22 10:30:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:30:10,768 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:30:10,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:30:10,768 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 10:30:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash 5053645, now seen corresponding path program 1 times [2020-06-22 10:30:10,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:10,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:30:10,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:30:10,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,805 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 3 states. [2020-06-22 10:30:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:10,877 INFO L93 Difference]: Finished difference Result 30 states and 46 transitions. [2020-06-22 10:30:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:10,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:30:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:30:10,878 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:30:10,878 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:30:10,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:30:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:30:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:30:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:30:10,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:30:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:30:10,880 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:30:10,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:30:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:30:10,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:30:10,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:30:10,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:30:10,952 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point L11-5(lines 11 21) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point L11-7(lines 11 21) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,954 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,955 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 20) no Hoare annotation was computed. [2020-06-22 10:30:10,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:30:10,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:30:10,955 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 19) no Hoare annotation was computed. [2020-06-22 10:30:10,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,956 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 10:30:10,956 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 10 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 10:30:10,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,956 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:30:10,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,956 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:30:10,958 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 10:30:10,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:30:10,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,958 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,959 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 10:30:10,959 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,959 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 10:30:10,959 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:30:10,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:10,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:30:10 BasicIcfg [2020-06-22 10:30:10,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:30:10,984 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:30:10,984 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:30:10,987 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:30:10,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:30:10,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:30:09" (1/5) ... [2020-06-22 10:30:10,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:30:10, skipping insertion in model container [2020-06-22 10:30:10,989 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:30:10,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:30:09" (2/5) ... [2020-06-22 10:30:10,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:30:10, skipping insertion in model container [2020-06-22 10:30:10,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:30:10,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:30:09" (3/5) ... [2020-06-22 10:30:10,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:30:10, skipping insertion in model container [2020-06-22 10:30:10,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:30:10,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:30:09" (4/5) ... [2020-06-22 10:30:10,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:30:10, skipping insertion in model container [2020-06-22 10:30:10,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:30:10,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:30:10" (5/5) ... [2020-06-22 10:30:10,993 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:30:11,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:30:11,015 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:30:11,015 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:30:11,016 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:30:11,016 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:30:11,016 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:30:11,016 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:30:11,016 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:30:11,016 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:30:11,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 10:30:11,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:30:11,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,032 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,032 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:30:11,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 10:30:11,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:30:11,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,036 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,037 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,042 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 34#L9true [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 33#L9-1true [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 51#L17-4true [2020-06-22 10:30:11,043 INFO L796 eck$LassoCheckResult]: Loop: 51#L17-4true [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 26#L11true [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 24#L11-1true [130] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short4_5|) InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} AuxVars[] AssignedVars[] 5#L11-5true [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 38#L12true [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 37#L12-1true [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 35#L12-2true [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 48#L13-3true [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 50#L13-1true [191] L13-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 51#L17-4true [2020-06-22 10:30:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 1 times [2020-06-22 10:30:11,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -482454925, now seen corresponding path program 1 times [2020-06-22 10:30:11,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:30:11,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:30:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:11,110 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 10:30:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:11,247 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. [2020-06-22 10:30:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:11,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 90 transitions. [2020-06-22 10:30:11,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:30:11,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 23 states and 32 transitions. [2020-06-22 10:30:11,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 10:30:11,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:30:11,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2020-06-22 10:30:11,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:11,257 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-22 10:30:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2020-06-22 10:30:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-06-22 10:30:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:30:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-06-22 10:30:11,260 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 10:30:11,261 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 10:30:11,261 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:30:11,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-06-22 10:30:11,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 10:30:11,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,263 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 124#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 123#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 120#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 114#L17-4 [2020-06-22 10:30:11,263 INFO L796 eck$LassoCheckResult]: Loop: 114#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 130#L11 [222] L11-->L11-1: Formula: (and (>= 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|) (not |v_ULTIMATE.start_test_fun_#t~short4_2|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 131#L11-1 [130] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short4_5|) InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} AuxVars[] AssignedVars[] 116#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 117#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 132#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 126#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 119#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 113#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 114#L17-4 [2020-06-22 10:30:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 2 times [2020-06-22 10:30:11,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1260397044, now seen corresponding path program 1 times [2020-06-22 10:30:11,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:30:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:30:11,300 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:30:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:30:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:30:11,300 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-06-22 10:30:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:11,333 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 10:30:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:30:11,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-06-22 10:30:11,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:30:11,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 27 transitions. [2020-06-22 10:30:11,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:30:11,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:30:11,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-06-22 10:30:11,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:11,336 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:30:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-06-22 10:30:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:30:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:30:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-06-22 10:30:11,338 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:30:11,338 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:30:11,338 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:30:11,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-06-22 10:30:11,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:30:11,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,340 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 175#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 173#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 171#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 165#L17-4 [2020-06-22 10:30:11,341 INFO L796 eck$LassoCheckResult]: Loop: 165#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 181#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 176#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 174#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 172#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 167#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 168#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 182#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 177#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 178#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 179#L13-1 [191] L13-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 165#L17-4 [2020-06-22 10:30:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 3 times [2020-06-22 10:30:11,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1733772375, now seen corresponding path program 1 times [2020-06-22 10:30:11,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:30:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:30:11,397 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:30:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:30:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:30:11,397 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 10:30:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:11,489 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-06-22 10:30:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:30:11,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-06-22 10:30:11,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-06-22 10:30:11,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2020-06-22 10:30:11,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-06-22 10:30:11,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 10:30:11,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2020-06-22 10:30:11,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:11,492 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-06-22 10:30:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2020-06-22 10:30:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-06-22 10:30:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 10:30:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-06-22 10:30:11,494 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-06-22 10:30:11,495 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-06-22 10:30:11,495 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:30:11,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-06-22 10:30:11,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:30:11,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,496 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,496 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,497 INFO L794 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 239#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 237#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 235#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 229#L17-4 [2020-06-22 10:30:11,498 INFO L796 eck$LassoCheckResult]: Loop: 229#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 245#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 240#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 238#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 236#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 231#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 232#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 246#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 241#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 234#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 228#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 229#L17-4 [2020-06-22 10:30:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 4 times [2020-06-22 10:30:11,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1733730741, now seen corresponding path program 1 times [2020-06-22 10:30:11,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:30:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:30:11,548 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:30:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:30:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:30:11,548 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 10:30:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:11,638 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-06-22 10:30:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:30:11,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2020-06-22 10:30:11,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 10:30:11,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2020-06-22 10:30:11,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-06-22 10:30:11,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 10:30:11,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-06-22 10:30:11,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:11,641 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-06-22 10:30:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-06-22 10:30:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-06-22 10:30:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:30:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-06-22 10:30:11,643 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-06-22 10:30:11,643 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-06-22 10:30:11,643 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:30:11,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-06-22 10:30:11,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 10:30:11,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:11,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:11,645 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:30:11,645 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:11,646 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 303#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 301#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 298#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 299#L17-4 [2020-06-22 10:30:11,646 INFO L796 eck$LassoCheckResult]: Loop: 299#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 310#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 304#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 302#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 300#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 294#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 295#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 311#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 305#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 306#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 292#L17-1 [152] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 293#L18 [108] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 296#L18-1 [270] L18-1-->L17-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_21 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_28)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_28 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_28) v_ULTIMATE.start_test_fun_~y_ref~0.offset_21 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_21) (= 1 (select |v_#valid_46| v_ULTIMATE.start_test_fun_~y_ref~0.base_28))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_28, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_21} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_28, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 297#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 315#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 299#L17-4 [2020-06-22 10:30:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 5 times [2020-06-22 10:30:11,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027297, now seen corresponding path program 1 times [2020-06-22 10:30:11,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:30:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash -720606084, now seen corresponding path program 1 times [2020-06-22 10:30:11,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:11,883 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-06-22 10:30:12,124 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2020-06-22 10:30:12,223 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:30:12,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:30:12,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:30:12,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:30:12,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:30:12,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:30:12,225 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:30:12,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:30:12,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:30:12,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:30:12,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:30:12,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,436 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-06-22 10:30:12,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:12,829 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:30:12,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:30:12,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:12,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:12,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:12,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:12,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:12,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:12,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:12,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:12,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:12,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:12,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:12,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:30:12,975 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:30:12,975 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:30:12,978 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:30:12,979 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:30:12,980 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:30:12,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:30:13,009 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:30:13,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:30:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,092 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-06-22 10:30:13,094 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,097 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2020-06-22 10:30:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:30:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,157 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-06-22 10:30:13,158 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,159 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,160 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,160 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2020-06-22 10:30:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,219 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-06-22 10:30:13,219 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,220 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,221 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,221 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2020-06-22 10:30:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,296 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-06-22 10:30:13,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,298 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,298 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,298 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2020-06-22 10:30:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,324 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-06-22 10:30:13,324 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,327 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,327 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2020-06-22 10:30:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-06-22 10:30:13,360 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,362 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,362 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,362 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2020-06-22 10:30:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-06-22 10:30:13,435 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,439 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,439 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,439 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2020-06-22 10:30:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:13,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:30:13,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:13,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:30:13,571 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,577 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:30:13,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:30:13,578 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2020-06-22 10:30:13,702 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 10:30:13,708 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2020-06-22 10:30:13,709 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 31 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-06-22 10:30:14,384 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 31 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 127 states and 142 transitions. Complement of second has 42 states. [2020-06-22 10:30:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 19 non-accepting loop states 2 accepting loop states [2020-06-22 10:30:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:30:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2020-06-22 10:30:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 4 letters. Loop has 15 letters. [2020-06-22 10:30:14,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:14,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 19 letters. Loop has 15 letters. [2020-06-22 10:30:14,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:14,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 4 letters. Loop has 30 letters. [2020-06-22 10:30:14,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:14,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 142 transitions. [2020-06-22 10:30:14,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-06-22 10:30:14,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 42 states and 47 transitions. [2020-06-22 10:30:14,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-06-22 10:30:14,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-06-22 10:30:14,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 47 transitions. [2020-06-22 10:30:14,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:14,403 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-06-22 10:30:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 47 transitions. [2020-06-22 10:30:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-06-22 10:30:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:30:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-06-22 10:30:14,406 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-06-22 10:30:14,406 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-06-22 10:30:14,406 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:30:14,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2020-06-22 10:30:14,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 10:30:14,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:14,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:14,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:14,408 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:14,408 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 961#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 960#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 957#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 958#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 969#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 970#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 959#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 956#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 952#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 953#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 968#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 962#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 963#L13-3 [2020-06-22 10:30:14,409 INFO L796 eck$LassoCheckResult]: Loop: 963#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 964#L13-1 [158] L13-1-->L14: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 971#L14 [122] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 974#L14-1 [269] L14-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_17) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24) v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_23|)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 975#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 976#L13-1 [191] L13-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 972#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 973#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 965#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 966#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 981#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 980#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 979#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 978#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 977#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 963#L13-3 [2020-06-22 10:30:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash -208621793, now seen corresponding path program 1 times [2020-06-22 10:30:14,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:14,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:14,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:14,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1222541880, now seen corresponding path program 1 times [2020-06-22 10:30:14,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:14,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:14,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:14,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:30:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:30:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:30:14,461 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:30:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:30:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:30:14,462 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 10:30:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:14,524 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-06-22 10:30:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:30:14,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2020-06-22 10:30:14,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:30:14,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2020-06-22 10:30:14,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:30:14,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:30:14,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2020-06-22 10:30:14,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:14,532 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-06-22 10:30:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2020-06-22 10:30:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-06-22 10:30:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:30:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-06-22 10:30:14,533 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-06-22 10:30:14,533 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-06-22 10:30:14,534 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:30:14,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-06-22 10:30:14,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:30:14,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:30:14,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:30:14,535 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:30:14,535 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:30:14,536 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY [132] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1020#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 1018#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1015#L9-1 [137] L9-1-->L17-4: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1016#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 1026#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 1021#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 1019#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1017#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 1013#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 1014#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1027#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1022#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 1023#L13-3 [2020-06-22 10:30:14,536 INFO L796 eck$LassoCheckResult]: Loop: 1023#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1024#L13-1 [158] L13-1-->L14: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1028#L14 [122] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1029#L14-1 [269] L14-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_17) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24) v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_23|)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 1023#L13-3 [2020-06-22 10:30:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -208621793, now seen corresponding path program 2 times [2020-06-22 10:30:14,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash 5667224, now seen corresponding path program 1 times [2020-06-22 10:30:14,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:14,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:14,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:30:14,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1335781814, now seen corresponding path program 1 times [2020-06-22 10:30:14,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:30:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:30:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:30:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:30:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:14,913 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-06-22 10:30:14,994 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:30:14,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:30:14,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:30:14,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:30:14,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:30:14,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:30:14,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:30:14,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:30:14,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:30:14,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:30:14,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:30:14,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,148 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-06-22 10:30:15,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:30:15,428 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:30:15,429 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:30:15,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:15,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:15,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:30:15,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:30:15,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:30:15,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:30:15,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:30:15,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:30:15,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:30:15,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:30:15,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:30:15,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:30:15,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:30:15,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:30:15,494 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:30:15,494 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:30:15,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:30:15,496 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:30:15,496 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:30:15,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-06-22 10:30:15,513 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-06-22 10:30:15,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:30:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:30:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:15,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:30:15,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:30:15,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:30:15,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:30:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:30:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:30:15,623 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:30:15,624 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:30:15,624 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 10:30:15,624 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-06-22 10:30:15,650 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 21 states and 25 transitions. Complement of second has 8 states. [2020-06-22 10:30:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 10:30:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:30:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 10:30:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 10:30:15,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 17 letters. Loop has 4 letters. [2020-06-22 10:30:15,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 10:30:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:30:15,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-06-22 10:30:15,657 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:30:15,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:30:15,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:30:15,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:30:15,658 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:30:15,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:30:15,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:30:15,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:30:15,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:30:15 BasicIcfg [2020-06-22 10:30:15,664 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:30:15,665 INFO L168 Benchmark]: Toolchain (without parser) took 6598.33 ms. Allocated memory was 649.6 MB in the beginning and 844.6 MB in the end (delta: 195.0 MB). Free memory was 559.5 MB in the beginning and 766.6 MB in the end (delta: -207.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:30:15,666 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:30:15,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.65 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.4 MB in the beginning and 638.2 MB in the end (delta: -79.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.59 ms. Allocated memory is still 673.2 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,667 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 ms. Allocated memory is still 673.2 MB. Free memory was 636.1 MB in the beginning and 635.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,668 INFO L168 Benchmark]: RCFGBuilder took 355.02 ms. Allocated memory is still 673.2 MB. Free memory was 635.0 MB in the beginning and 607.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,668 INFO L168 Benchmark]: BlockEncodingV2 took 134.34 ms. Allocated memory is still 673.2 MB. Free memory was 607.2 MB in the beginning and 595.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,669 INFO L168 Benchmark]: TraceAbstraction took 1066.71 ms. Allocated memory is still 673.2 MB. Free memory was 595.3 MB in the beginning and 487.3 MB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:30:15,669 INFO L168 Benchmark]: BuchiAutomizer took 4680.92 ms. Allocated memory was 673.2 MB in the beginning and 844.6 MB in the end (delta: 171.4 MB). Free memory was 487.3 MB in the beginning and 766.6 MB in the end (delta: -279.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:30:15,673 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 58 locations, 65 edges - StatisticsResult: Encoded RCFG 51 locations, 88 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.65 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.4 MB in the beginning and 638.2 MB in the end (delta: -79.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.59 ms. Allocated memory is still 673.2 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.96 ms. Allocated memory is still 673.2 MB. Free memory was 636.1 MB in the beginning and 635.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 355.02 ms. Allocated memory is still 673.2 MB. Free memory was 635.0 MB in the beginning and 607.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 134.34 ms. Allocated memory is still 673.2 MB. Free memory was 607.2 MB in the beginning and 595.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1066.71 ms. Allocated memory is still 673.2 MB. Free memory was 595.3 MB in the beginning and 487.3 MB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4680.92 ms. Allocated memory was 673.2 MB in the beginning and 844.6 MB in the end (delta: 171.4 MB). Free memory was 487.3 MB in the beginning and 766.6 MB in the end (delta: -279.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 10:30:15,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:30:15,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 - InvariantResult [Line: 17]: Loop Invariant [2020-06-22 10:30:15,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:30:15,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 28 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 190 SDslu, 2 SDs, 0 SdLazy, 182 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 81 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 108 SDtfs, 150 SDslu, 285 SDs, 0 SdLazy, 657 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf100 lsp96 ukn68 mio100 lsp35 div100 bol100 ite100 ukn100 eq181 hnf89 smp98 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:30:05.779 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:30:15.914 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check