YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:23:38,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:23:38,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:23:38,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:23:38,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:23:38,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:23:38,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:23:38,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:23:38,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:23:38,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:23:38,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:23:38,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:23:38,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:23:38,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:23:38,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:23:38,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:23:38,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:23:38,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:23:38,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:23:38,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:23:38,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:23:38,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:23:38,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:23:38,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:23:38,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:23:38,390 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:23:38,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:23:38,391 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:23:38,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:23:38,392 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:23:38,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:23:38,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:23:38,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:23:38,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:23:38,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:23:38,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:23:38,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:23:38,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:23:38,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:23:38,397 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:23:38,411 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:23:38,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:23:38,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:23:38,413 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:23:38,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:23:38,413 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:23:38,413 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:23:38,413 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:23:38,413 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:23:38,414 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:23:38,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:23:38,415 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:23:38,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:23:38,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:23:38,415 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:23:38,415 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:23:38,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:23:38,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:23:38,416 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:23:38,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:23:38,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:23:38,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:23:38,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:23:38,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:23:38,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:23:38,455 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:23:38,459 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:23:38,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:23:38,461 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:23:38,461 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:23:38,524 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d53ebacc47b94f16900d8dadc16d819e/FLAGc4d800615 !SESSION 2020-06-22 08:23:36.053 ----------------------------------------------- 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.cdt.core 1 0 2020-06-22 08:23:38.794 !MESSAGE Indexed 'FLAGc4d800615' (0 sources, 0 headers) in 0.014 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 08:23:38,878 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:23:38,879 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:23:38,879 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:23:38,885 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d53ebacc47b94f16900d8dadc16d819e/FLAGc4d800615 [2020-06-22 08:23:39,375 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d53ebacc47b94f16900d8dadc16d819e [2020-06-22 08:23:39,386 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:23:39,388 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:23:39,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:23:39,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:23:39,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:23:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22763628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39, skipping insertion in model container [2020-06-22 08:23:39,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:23:39,421 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:23:39,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:23:39,646 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:23:39,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:23:39,680 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:23:39,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39 WrapperNode [2020-06-22 08:23:39,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:23:39,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:23:39,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:23:39,681 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:23:39,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:23:39,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:23:39,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:23:39,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:23:39,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (1/1) ... [2020-06-22 08:23:39,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:23:39,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:23:39,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:23:39,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:23:39,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (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 08:23:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:23:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:23:39,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:23:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:23:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:23:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:23:40,071 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:23:40,072 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 08:23:40,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:23:40 BoogieIcfgContainer [2020-06-22 08:23:40,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:23:40,074 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:23:40,074 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:23:40,076 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:23:40,077 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:23:40" (1/1) ... [2020-06-22 08:23:40,094 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges [2020-06-22 08:23:40,095 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:23:40,096 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:23:40,096 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:23:40,097 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:23:40,098 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:23:40,099 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:23:40,100 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:23:40,123 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:23:40,182 INFO L200 BlockEncoder]: SBE split 24 edges [2020-06-22 08:23:40,187 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:23:40,189 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:23:40,212 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 08:23:40,215 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:23:40,217 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:23:40,217 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:23:40,217 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:23:40,218 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:23:40,219 INFO L313 BlockEncoder]: Encoded RCFG 37 locations, 93 edges [2020-06-22 08:23:40,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:23:40 BasicIcfg [2020-06-22 08:23:40,219 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:23:40,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:23:40,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:23:40,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:23:40,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:23:39" (1/4) ... [2020-06-22 08:23:40,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3df8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:23:40, skipping insertion in model container [2020-06-22 08:23:40,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (2/4) ... [2020-06-22 08:23:40,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3df8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:23:40, skipping insertion in model container [2020-06-22 08:23:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:23:40" (3/4) ... [2020-06-22 08:23:40,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3df8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:23:40, skipping insertion in model container [2020-06-22 08:23:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:23:40" (4/4) ... [2020-06-22 08:23:40,228 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:23:40,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:23:40,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-06-22 08:23:40,263 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-06-22 08:23:40,292 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:23:40,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:23:40,293 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:23:40,293 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:23:40,293 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:23:40,293 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:23:40,293 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:23:40,293 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:23:40,294 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:23:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-06-22 08:23:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:23:40,315 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:40,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:23:40,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash 4215459, now seen corresponding path program 1 times [2020-06-22 08:23:40,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:40,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:40,517 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 08:23:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:40,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:40,540 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-06-22 08:23:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:40,846 INFO L93 Difference]: Finished difference Result 37 states and 93 transitions. [2020-06-22 08:23:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:40,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:23:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:40,863 INFO L225 Difference]: With dead ends: 37 [2020-06-22 08:23:40,863 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:23:40,867 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 08:23:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:23:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:23:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:23:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2020-06-22 08:23:40,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 85 transitions. Word has length 4 [2020-06-22 08:23:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 85 transitions. [2020-06-22 08:23:40,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 85 transitions. [2020-06-22 08:23:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:23:40,908 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:40,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:23:40,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 4215461, now seen corresponding path program 1 times [2020-06-22 08:23:40,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:40,939 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 08:23:40,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:40,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:40,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:40,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:40,942 INFO L87 Difference]: Start difference. First operand 33 states and 85 transitions. Second operand 3 states. [2020-06-22 08:23:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:41,130 INFO L93 Difference]: Finished difference Result 37 states and 85 transitions. [2020-06-22 08:23:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:41,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:23:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:41,132 INFO L225 Difference]: With dead ends: 37 [2020-06-22 08:23:41,132 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:23:41,133 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 08:23:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:23:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:23:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:23:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 81 transitions. [2020-06-22 08:23:41,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 81 transitions. Word has length 4 [2020-06-22 08:23:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:41,138 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 81 transitions. [2020-06-22 08:23:41,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 81 transitions. [2020-06-22 08:23:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:23:41,139 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:41,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:23:41,139 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 4215462, now seen corresponding path program 1 times [2020-06-22 08:23:41,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:41,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:41,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:41,193 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 08:23:41,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:41,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:41,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:41,194 INFO L87 Difference]: Start difference. First operand 33 states and 81 transitions. Second operand 3 states. [2020-06-22 08:23:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:41,412 INFO L93 Difference]: Finished difference Result 33 states and 81 transitions. [2020-06-22 08:23:41,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:23:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:41,413 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:23:41,413 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:23:41,414 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 08:23:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:23:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 08:23:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:23:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2020-06-22 08:23:41,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 77 transitions. Word has length 4 [2020-06-22 08:23:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:41,419 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 77 transitions. [2020-06-22 08:23:41,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 77 transitions. [2020-06-22 08:23:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:23:41,420 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:41,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:23:41,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash 130676584, now seen corresponding path program 1 times [2020-06-22 08:23:41,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:41,472 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 08:23:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:41,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:41,474 INFO L87 Difference]: Start difference. First operand 29 states and 77 transitions. Second operand 3 states. [2020-06-22 08:23:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:41,645 INFO L93 Difference]: Finished difference Result 29 states and 77 transitions. [2020-06-22 08:23:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:41,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:23:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:41,646 INFO L225 Difference]: With dead ends: 29 [2020-06-22 08:23:41,646 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:23:41,647 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 08:23:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:23:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 08:23:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:23:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2020-06-22 08:23:41,651 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 71 transitions. Word has length 5 [2020-06-22 08:23:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:41,651 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 71 transitions. [2020-06-22 08:23:41,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 71 transitions. [2020-06-22 08:23:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:23:41,652 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:41,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:23:41,652 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash 130676586, now seen corresponding path program 1 times [2020-06-22 08:23:41,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:41,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:41,679 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 08:23:41,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:41,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:41,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:41,681 INFO L87 Difference]: Start difference. First operand 26 states and 71 transitions. Second operand 3 states. [2020-06-22 08:23:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:41,838 INFO L93 Difference]: Finished difference Result 29 states and 71 transitions. [2020-06-22 08:23:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:41,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:23:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:41,840 INFO L225 Difference]: With dead ends: 29 [2020-06-22 08:23:41,840 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:23:41,840 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 08:23:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:23:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 08:23:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:23:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2020-06-22 08:23:41,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 68 transitions. Word has length 5 [2020-06-22 08:23:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 68 transitions. [2020-06-22 08:23:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 68 transitions. [2020-06-22 08:23:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:23:41,847 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:41,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:23:41,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash 130676587, now seen corresponding path program 1 times [2020-06-22 08:23:41,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:41,897 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 08:23:41,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:41,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:41,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:41,898 INFO L87 Difference]: Start difference. First operand 26 states and 68 transitions. Second operand 3 states. [2020-06-22 08:23:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:42,068 INFO L93 Difference]: Finished difference Result 26 states and 68 transitions. [2020-06-22 08:23:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:42,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:23:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:42,070 INFO L225 Difference]: With dead ends: 26 [2020-06-22 08:23:42,070 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 08:23:42,070 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 08:23:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 08:23:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 08:23:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 08:23:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2020-06-22 08:23:42,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 65 transitions. Word has length 5 [2020-06-22 08:23:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:42,074 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 65 transitions. [2020-06-22 08:23:42,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 65 transitions. [2020-06-22 08:23:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:23:42,075 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:42,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,075 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1743744171, now seen corresponding path program 1 times [2020-06-22 08:23:42,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:42,101 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 08:23:42,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:42,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:23:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:42,103 INFO L87 Difference]: Start difference. First operand 23 states and 65 transitions. Second operand 3 states. [2020-06-22 08:23:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:42,274 INFO L93 Difference]: Finished difference Result 43 states and 95 transitions. [2020-06-22 08:23:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:42,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 08:23:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:42,275 INFO L225 Difference]: With dead ends: 43 [2020-06-22 08:23:42,275 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 08:23:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:23:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 08:23:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 08:23:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 08:23:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2020-06-22 08:23:42,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 62 transitions. Word has length 8 [2020-06-22 08:23:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:42,279 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 62 transitions. [2020-06-22 08:23:42,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 62 transitions. [2020-06-22 08:23:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:23:42,279 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:42,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745132, now seen corresponding path program 1 times [2020-06-22 08:23:42,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:42,320 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 08:23:42,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:42,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:42,322 INFO L87 Difference]: Start difference. First operand 23 states and 62 transitions. Second operand 3 states. [2020-06-22 08:23:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:42,461 INFO L93 Difference]: Finished difference Result 23 states and 62 transitions. [2020-06-22 08:23:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:42,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 08:23:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:42,462 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:23:42,462 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:23:42,462 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 08:23:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:23:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:23:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:23:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2020-06-22 08:23:42,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 56 transitions. Word has length 8 [2020-06-22 08:23:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:42,466 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 56 transitions. [2020-06-22 08:23:42,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 56 transitions. [2020-06-22 08:23:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:23:42,466 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:42,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745134, now seen corresponding path program 1 times [2020-06-22 08:23:42,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:42,502 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 08:23:42,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:42,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:42,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:42,504 INFO L87 Difference]: Start difference. First operand 20 states and 56 transitions. Second operand 3 states. [2020-06-22 08:23:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:42,628 INFO L93 Difference]: Finished difference Result 23 states and 56 transitions. [2020-06-22 08:23:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:42,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 08:23:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:42,629 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:23:42,629 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:23:42,630 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 08:23:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:23:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:23:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:23:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. [2020-06-22 08:23:42,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 53 transitions. Word has length 8 [2020-06-22 08:23:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:42,633 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 53 transitions. [2020-06-22 08:23:42,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 53 transitions. [2020-06-22 08:23:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:23:42,633 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:23:42,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:23:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745135, now seen corresponding path program 1 times [2020-06-22 08:23:42,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:42,674 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 08:23:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:23:42,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:23:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:42,675 INFO L87 Difference]: Start difference. First operand 20 states and 53 transitions. Second operand 3 states. [2020-06-22 08:23:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:42,815 INFO L93 Difference]: Finished difference Result 20 states and 53 transitions. [2020-06-22 08:23:42,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:42,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 08:23:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:23:42,816 INFO L225 Difference]: With dead ends: 20 [2020-06-22 08:23:42,816 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:23:42,816 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 08:23:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:23:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:23:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:23:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:23:42,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2020-06-22 08:23:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:23:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:23:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:23:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:23:42,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:23:42,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:23:42,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 15) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:23:42,827 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 08:23:42,828 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point L16-5(lines 16 19) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:23:42,829 INFO L448 ceAbstractionStarter]: For program point L16-7(lines 5 21) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:23:42,831 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:23:42,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:23:42 BasicIcfg [2020-06-22 08:23:42,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:23:42,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:23:42,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:23:42,838 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:23:42,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:23:42,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:23:39" (1/5) ... [2020-06-22 08:23:42,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39ba90f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:23:42, skipping insertion in model container [2020-06-22 08:23:42,839 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:23:42,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:23:39" (2/5) ... [2020-06-22 08:23:42,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39ba90f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:23:42, skipping insertion in model container [2020-06-22 08:23:42,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:23:42,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:23:40" (3/5) ... [2020-06-22 08:23:42,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39ba90f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:23:42, skipping insertion in model container [2020-06-22 08:23:42,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:23:42,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:23:40" (4/5) ... [2020-06-22 08:23:42,841 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39ba90f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:23:42, skipping insertion in model container [2020-06-22 08:23:42,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:23:42,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:23:42" (5/5) ... [2020-06-22 08:23:42,842 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:23:42,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:23:42,863 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:23:42,863 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:23:42,863 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:23:42,863 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:23:42,863 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:23:42,863 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:23:42,864 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:23:42,864 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:23:42,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-06-22 08:23:42,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:42,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:23:42,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:23:42,878 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:23:42,878 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,878 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:23:42,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-06-22 08:23:42,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:42,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:23:42,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:23:42,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:23:42,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:42,887 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [106] 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 [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 35#L11true [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 18#L12true [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 31#L16-7true [2020-06-22 08:23:42,888 INFO L796 eck$LassoCheckResult]: Loop: 31#L16-7true [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 6#L16true [180] L16-->L16-1: Formula: (and (not |v_ULTIMATE.start_main_#t~short8_2|) (>= |v_ULTIMATE.start_main_#t~mem6_3| 100)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 3#L16-1true [65] L16-1-->L16-5: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 15#L16-5true [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 28#L17true [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 26#L17-1true [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 24#L17-2true [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 11#L18true [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 8#L18-1true [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 7#L18-2true [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 31#L16-7true [2020-06-22 08:23:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 4245190, now seen corresponding path program 1 times [2020-06-22 08:23:42,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1283019618, now seen corresponding path program 1 times [2020-06-22 08:23:42,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:42,949 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 08:23:42,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:23:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:23:42,949 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:23:42,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:23:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:23:42,951 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-06-22 08:23:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:23:43,146 INFO L93 Difference]: Finished difference Result 39 states and 94 transitions. [2020-06-22 08:23:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:23:43,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 94 transitions. [2020-06-22 08:23:43,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:43,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 50 transitions. [2020-06-22 08:23:43,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:23:43,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:23:43,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 50 transitions. [2020-06-22 08:23:43,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:23:43,154 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. [2020-06-22 08:23:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 50 transitions. [2020-06-22 08:23:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:23:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:23:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2020-06-22 08:23:43,157 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. [2020-06-22 08:23:43,157 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. [2020-06-22 08:23:43,157 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:23:43,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 50 transitions. [2020-06-22 08:23:43,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:43,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:23:43,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:23:43,159 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:23:43,159 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:43,159 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [106] 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] 95#L-1 [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 96#L11 [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 99#L12 [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 91#L16-7 [2020-06-22 08:23:43,160 INFO L796 eck$LassoCheckResult]: Loop: 91#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 92#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 87#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 88#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 101#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 98#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 93#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 89#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 85#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 86#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 94#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 90#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 91#L16-7 [2020-06-22 08:23:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 4245190, now seen corresponding path program 2 times [2020-06-22 08:23:43,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 1 times [2020-06-22 08:23:43,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:23:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2093456253, now seen corresponding path program 1 times [2020-06-22 08:23:43,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:43,724 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2020-06-22 08:23:43,883 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 08:23:43,897 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:23:43,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:23:43,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:23:43,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:23:43,899 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:23:43,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:23:43,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:23:43,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:23:43,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:23:43,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:23:43,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:23:43,919 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 08:23:43,929 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 08:23:43,931 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 08:23:43,933 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 08:23:43,937 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 08:23:43,942 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 08:23:43,944 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 08:23:43,948 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 08:23:43,951 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 08:23:43,957 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 08:23:43,959 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 08:23:43,961 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 08:23:43,963 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 08:23:43,966 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 08:23:44,389 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2020-06-22 08:23:44,500 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 08:23:44,921 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:23:44,926 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:23:44,928 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 08:23:44,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,937 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 08:23:44,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,940 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 08:23:44,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,942 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 08:23:44,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,949 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 08:23:44,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,954 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 08:23:44,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,957 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 08:23:44,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,959 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 08:23:44,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,964 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 08:23:44,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,970 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 08:23:44,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,973 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 08:23:44,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,975 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 08:23:44,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,977 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 08:23:44,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:44,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:44,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:44,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,980 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 08:23:44,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,991 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 08:23:44,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:44,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:44,996 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 08:23:44,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:44,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:44,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:44,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:44,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:44,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:45,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:45,002 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 08:23:45,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:45,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:45,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:45,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:45,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:45,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:45,018 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:23:45,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:23:45,026 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:23:45,028 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:23:45,030 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:23:45,031 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:23:45,031 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2020-06-22 08:23:45,202 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-06-22 08:23:45,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:23:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:45,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:45,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:45,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:23:45,327 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-06-22 08:23:45,328 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:45,337 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:45,338 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:45,338 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2020-06-22 08:23:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:45,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:45,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:45,524 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:45,525 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:45,540 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:45,631 INFO L497 ElimStorePlain]: treesize reduction 52, result has 62.0 percent of original size [2020-06-22 08:23:45,634 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:45,635 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:81 [2020-06-22 08:23:45,800 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 08:23:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:46,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:46,372 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:46,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 71 [2020-06-22 08:23:46,382 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:46,463 INFO L497 ElimStorePlain]: treesize reduction 49, result has 61.7 percent of original size [2020-06-22 08:23:46,466 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:46,466 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2020-06-22 08:23:46,671 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2020-06-22 08:23:46,672 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:46,689 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:46,690 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2020-06-22 08:23:46,691 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:46,702 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2020-06-22 08:23:46,703 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:46,823 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2020-06-22 08:23:46,824 INFO L497 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size [2020-06-22 08:23:46,826 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-06-22 08:23:46,826 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:169, output treesize:120 [2020-06-22 08:23:47,029 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-06-22 08:23:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:48,066 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:23:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:48,078 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:23:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:48,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:48,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:48,103 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:48,104 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:48,105 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,131 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:48,131 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,132 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:48,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:48,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:48,172 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:48,172 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:48,173 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,200 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:48,201 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,201 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:48,234 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:48,235 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:48,242 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:48,332 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size [2020-06-22 08:23:48,334 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:48,335 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 [2020-06-22 08:23:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:48,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:48,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:48,401 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:48,401 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:48,402 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,438 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:48,439 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:48,439 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:48,484 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:48,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:48,490 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:48,572 INFO L497 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size [2020-06-22 08:23:48,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:48,578 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 [2020-06-22 08:23:48,663 INFO L98 LoopCannibalizer]: 16 predicates before loop cannibalization 28 predicates after loop cannibalization [2020-06-22 08:23:48,669 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 28 loop predicates [2020-06-22 08:23:48,670 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 50 transitions. cyclomatic complexity: 34 Second operand 8 states. [2020-06-22 08:23:51,828 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-06-22 08:23:52,185 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-06-22 08:23:52,639 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 50 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 351 states and 394 transitions. Complement of second has 171 states. [2020-06-22 08:23:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 38 states 5 stem states 31 non-accepting loop states 2 accepting loop states [2020-06-22 08:23:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:23:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 163 transitions. [2020-06-22 08:23:52,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 08:23:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:52,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 08:23:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:52,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 08:23:52,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:52,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 351 states and 394 transitions. [2020-06-22 08:23:52,668 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 84 [2020-06-22 08:23:52,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 351 states to 196 states and 233 transitions. [2020-06-22 08:23:52,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2020-06-22 08:23:52,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2020-06-22 08:23:52,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 233 transitions. [2020-06-22 08:23:52,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:23:52,673 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-06-22 08:23:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 233 transitions. [2020-06-22 08:23:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 18. [2020-06-22 08:23:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:23:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2020-06-22 08:23:52,676 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 51 transitions. [2020-06-22 08:23:52,676 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 51 transitions. [2020-06-22 08:23:52,676 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:23:52,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 51 transitions. [2020-06-22 08:23:52,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:52,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:23:52,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:23:52,678 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:23:52,678 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:52,679 INFO L794 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY [106] 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] 1103#L-1 [157] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 1104#L11 [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1109#L12 [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 1100#L16-7 [2020-06-22 08:23:52,679 INFO L796 eck$LassoCheckResult]: Loop: 1100#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1097#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1093#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1094#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1110#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1108#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1101#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1098#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1095#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 1096#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1102#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1099#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 1100#L16-7 [2020-06-22 08:23:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash 4237502, now seen corresponding path program 1 times [2020-06-22 08:23:52,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 2 times [2020-06-22 08:23:52,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1268968837, now seen corresponding path program 1 times [2020-06-22 08:23:52,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:23:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:53,203 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2020-06-22 08:23:53,369 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-06-22 08:23:53,372 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:23:53,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:23:53,373 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:23:53,373 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:23:53,373 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:23:53,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:23:53,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:23:53,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:23:53,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 08:23:53,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:23:53,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:23:53,377 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 08:23:53,379 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 08:23:53,381 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 08:23:53,751 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2020-06-22 08:23:53,859 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 08:23:53,860 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 08:23:53,862 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 08:23:53,864 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 08:23:53,866 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 08:23:53,868 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 08:23:53,872 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 08:23:53,873 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 08:23:53,877 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 08:23:53,879 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 08:23:53,881 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 08:23:53,882 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 08:23:54,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:23:54,346 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:23:54,347 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 08:23:54,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:54,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:54,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:54,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,349 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 08:23:54,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,353 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 08:23:54,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,359 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 08:23:54,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,365 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 08:23:54,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,373 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 08:23:54,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:54,394 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 08:23:54,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:54,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:54,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:54,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:54,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:54,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:54,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:23:54,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:23:54,411 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:23:54,411 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:23:54,412 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:23:54,412 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:23:54,412 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2020-06-22 08:23:54,571 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-06-22 08:23:54,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:23:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:54,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:23:54,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:54,654 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:54,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-06-22 08:23:54,655 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:54,671 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:54,671 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:54,671 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:17 [2020-06-22 08:23:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:54,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:54,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:54,862 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:54,863 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:54,869 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:54,976 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-06-22 08:23:54,977 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size [2020-06-22 08:23:54,979 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:54,979 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 [2020-06-22 08:23:55,137 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 08:23:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:55,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:55,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:55,538 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:55,539 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 71 [2020-06-22 08:23:55,546 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:55,627 INFO L497 ElimStorePlain]: treesize reduction 49, result has 61.7 percent of original size [2020-06-22 08:23:55,629 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:55,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2020-06-22 08:23:55,809 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:55,810 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2020-06-22 08:23:55,811 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:55,823 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2020-06-22 08:23:55,824 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:55,835 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2020-06-22 08:23:55,836 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:55,961 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2020-06-22 08:23:55,961 INFO L497 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size [2020-06-22 08:23:55,963 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-06-22 08:23:55,963 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:169, output treesize:120 [2020-06-22 08:23:56,150 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-06-22 08:23:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:57,130 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:23:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:57,175 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:23:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:57,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:57,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:57,204 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:57,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:57,205 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,230 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:57,231 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,231 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:57,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:57,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:57,273 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:57,273 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:57,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,302 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:57,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:57,338 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:57,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:57,343 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:57,432 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size [2020-06-22 08:23:57,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:57,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 [2020-06-22 08:23:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:23:57,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:23:57,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:23:57,511 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:57,511 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2020-06-22 08:23:57,512 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,534 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2020-06-22 08:23:57,534 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:23:57,534 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2020-06-22 08:23:57,567 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:23:57,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2020-06-22 08:23:57,571 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:57,634 INFO L497 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size [2020-06-22 08:23:57,637 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:23:57,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 [2020-06-22 08:23:57,746 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 25 predicates after loop cannibalization [2020-06-22 08:23:57,746 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 25 loop predicates [2020-06-22 08:23:57,746 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 51 transitions. cyclomatic complexity: 34 Second operand 8 states. [2020-06-22 08:23:58,323 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 51 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 43 states and 77 transitions. Complement of second has 15 states. [2020-06-22 08:23:58,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-06-22 08:23:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:23:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-06-22 08:23:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 08:23:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 08:23:58,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 08:23:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:23:58,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 77 transitions. [2020-06-22 08:23:58,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:58,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 17 states and 48 transitions. [2020-06-22 08:23:58,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:23:58,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:23:58,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 48 transitions. [2020-06-22 08:23:58,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:23:58,338 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 48 transitions. [2020-06-22 08:23:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 48 transitions. [2020-06-22 08:23:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 08:23:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:23:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2020-06-22 08:23:58,341 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 47 transitions. [2020-06-22 08:23:58,341 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 47 transitions. [2020-06-22 08:23:58,341 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:23:58,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 47 transitions. [2020-06-22 08:23:58,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:23:58,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:23:58,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:23:58,342 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:23:58,342 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:23:58,343 INFO L794 eck$LassoCheckResult]: Stem: 1586#ULTIMATE.startENTRY [106] 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] 1584#L-1 [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 1585#L11 [108] L11-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1587#L14 [86] L14-->L16-7: Formula: (and (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6 (- 1)))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1579#L16-7 [2020-06-22 08:23:58,343 INFO L796 eck$LassoCheckResult]: Loop: 1579#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1581#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1576#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1577#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1589#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1588#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1582#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1580#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1574#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 1575#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1583#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1578#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 1579#L16-7 [2020-06-22 08:23:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash 4243366, now seen corresponding path program 1 times [2020-06-22 08:23:58,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 3 times [2020-06-22 08:23:58,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:23:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:23:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash 497683811, now seen corresponding path program 1 times [2020-06-22 08:23:58,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:23:58,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:23:58,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:23:58,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:23:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:23:58,904 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2020-06-22 08:23:59,055 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-06-22 08:23:59,059 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:23:59,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:23:59,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:23:59,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:23:59,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:23:59,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:23:59,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:23:59,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:23:59,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:23:59,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:23:59,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:23:59,062 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 08:23:59,064 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 08:23:59,066 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 08:23:59,067 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 08:23:59,069 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 08:23:59,071 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 08:23:59,073 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 08:23:59,074 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 08:23:59,078 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 08:23:59,080 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 08:23:59,423 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-06-22 08:23:59,528 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 08:23:59,532 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 08:23:59,534 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 08:23:59,535 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 08:23:59,537 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 08:23:59,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:23:59,930 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:23:59,931 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 08:23:59,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,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 08:23:59,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:59,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:59,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:59,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,936 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 08:23:59,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:59,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:59,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:59,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,938 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 08:23:59,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,941 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 08:23:59,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:59,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:59,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:59,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,943 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 08:23:59,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,946 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 08:23:59,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:59,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:59,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:59,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,948 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 08:23:59,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,953 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 08:23:59,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:23:59,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:23:59,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:23:59,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,955 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 08:23:59,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,959 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 08:23:59,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,965 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 08:23:59,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,969 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 08:23:59,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,975 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 08:23:59,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,980 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 08:23:59,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:23:59,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:23:59,990 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 08:23:59,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:23:59,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:23:59,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:23:59,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:23:59,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:23:59,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:00,002 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 08:24:00,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:00,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:00,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:00,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:00,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:00,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:00,008 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 08:24:00,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:00,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:00,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:00,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:00,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:00,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:00,030 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 08:24:00,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:00,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:00,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:00,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:00,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:00,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:00,034 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 08:24:00,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:00,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:00,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:00,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:00,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:00,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:00,038 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 08:24:00,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:00,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:00,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:00,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:00,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:00,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:00,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:24:00,050 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:24:00,050 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:24:00,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:24:00,051 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:24:00,052 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:24:00,052 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 1 >= 0] [2020-06-22 08:24:00,205 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-06-22 08:24:00,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:24:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:24:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:00,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 08:24:00,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:00,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:24:00,258 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-06-22 08:24:00,258 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:24:00,265 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:00,266 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:24:00,266 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2020-06-22 08:24:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:00,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:24:00,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:00,416 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:00,417 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 83 [2020-06-22 08:24:00,420 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:24:00,495 INFO L497 ElimStorePlain]: treesize reduction 55, result has 60.1 percent of original size [2020-06-22 08:24:00,496 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:00,496 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:62 [2020-06-22 08:24:06,717 WARN L188 SmtUtils]: Spent 3.49 s on a formula simplification that was a NOOP. DAG size: 42 [2020-06-22 08:24:08,602 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 08:24:09,621 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~y~0.base) c_ULTIMATE.start_main_~x~0.offset) 2) 0) (exists ((ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~x~0.base c_ULTIMATE.start_main_~y~0.base) (= ULTIMATE.start_main_~y~0.offset c_ULTIMATE.start_main_~x~0.offset))))) is different from true [2020-06-22 08:24:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:09,718 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:09,728 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:09,738 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:09,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:24:09,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:09,831 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2020-06-22 08:24:09,832 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:09,845 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:09,846 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:09,847 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:41 [2020-06-22 08:24:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:12,891 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:12,903 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:12,903 INFO L98 LoopCannibalizer]: 15 predicates before loop cannibalization 16 predicates after loop cannibalization [2020-06-22 08:24:12,903 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 16 loop predicates [2020-06-22 08:24:12,903 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 47 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-06-22 08:24:17,773 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 47 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 244 states and 279 transitions. Complement of second has 172 states. [2020-06-22 08:24:17,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 40 states 5 stem states 32 non-accepting loop states 3 accepting loop states [2020-06-22 08:24:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 08:24:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 141 transitions. [2020-06-22 08:24:17,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 08:24:17,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:17,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 08:24:17,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:17,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 08:24:17,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:17,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 279 transitions. [2020-06-22 08:24:17,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2020-06-22 08:24:17,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 116 states and 139 transitions. [2020-06-22 08:24:17,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2020-06-22 08:24:17,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-06-22 08:24:17,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 139 transitions. [2020-06-22 08:24:17,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:24:17,793 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 139 transitions. [2020-06-22 08:24:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 139 transitions. [2020-06-22 08:24:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 16. [2020-06-22 08:24:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:24:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-06-22 08:24:17,795 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 39 transitions. [2020-06-22 08:24:17,795 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 39 transitions. [2020-06-22 08:24:17,795 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:24:17,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 39 transitions. [2020-06-22 08:24:17,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:24:17,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:24:17,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:24:17,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:24:17,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:24:17,797 INFO L794 eck$LassoCheckResult]: Stem: 2383#ULTIMATE.startENTRY [106] 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] 2381#L-1 [157] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 2382#L11 [108] L11-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 2384#L14 [86] L14-->L16-7: Formula: (and (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6 (- 1)))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2377#L16-7 [2020-06-22 08:24:17,797 INFO L796 eck$LassoCheckResult]: Loop: 2377#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2378#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2373#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2374#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2386#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2385#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 2379#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2375#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 2371#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 2372#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2380#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2376#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 2377#L16-7 [2020-06-22 08:24:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:24:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash 4235678, now seen corresponding path program 1 times [2020-06-22 08:24:17,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:24:17,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:24:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:24:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:24:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 4 times [2020-06-22 08:24:17,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:24:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:24:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:24:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:24:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1322171227, now seen corresponding path program 1 times [2020-06-22 08:24:17,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:24:17,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:24:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:24:17,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:24:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:18,314 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-06-22 08:24:18,477 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-06-22 08:24:18,481 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:24:18,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:24:18,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:24:18,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:24:18,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:24:18,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:24:18,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:24:18,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:24:18,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 08:24:18,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:24:18,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:24:18,484 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 08:24:18,486 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 08:24:18,860 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-06-22 08:24:18,963 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 08:24:18,965 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 08:24:18,967 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 08:24:18,971 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 08:24:18,972 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 08:24:18,973 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 08:24:18,975 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 08:24:18,976 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 08:24:18,980 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 08:24:18,982 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 08:24:18,983 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 08:24:18,985 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 08:24:19,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:24:19,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:24:19,453 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 08:24:19,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,456 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 08:24:19,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,459 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 08:24:19,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,463 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 08:24:19,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,469 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 08:24:19,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,472 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 08:24:19,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,477 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 08:24:19,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,482 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 08:24:19,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,487 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 08:24:19,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,490 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 08:24:19,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,493 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 08:24:19,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,497 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 08:24:19,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,500 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 08:24:19,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:24:19,513 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 08:24:19,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:24:19,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:24:19,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:24:19,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:24:19,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:24:19,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:24:19,520 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:24:19,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:24:19,523 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:24:19,524 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:24:19,524 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:24:19,525 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:24:19,525 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 - 1 >= 0] [2020-06-22 08:24:19,667 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-06-22 08:24:19,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:24:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:24:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:24:19,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:19,728 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:19,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-06-22 08:24:19,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:24:19,740 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:19,741 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:24:19,741 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:17 [2020-06-22 08:24:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:19,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:24:19,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:19,884 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:19,885 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 83 [2020-06-22 08:24:19,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:24:19,963 INFO L497 ElimStorePlain]: treesize reduction 41, result has 66.9 percent of original size [2020-06-22 08:24:19,964 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:19,964 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:62 [2020-06-22 08:24:26,257 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 42 [2020-06-22 08:24:28,167 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 08:24:29,238 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~y~0.base) c_ULTIMATE.start_main_~x~0.offset) 2) 0) (exists ((ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~x~0.base c_ULTIMATE.start_main_~y~0.base) (= ULTIMATE.start_main_~y~0.offset c_ULTIMATE.start_main_~x~0.offset))))) is different from true [2020-06-22 08:24:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:29,335 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:29,345 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:29,355 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:24:29,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:24:29,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:24:29,443 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2020-06-22 08:24:29,444 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:29,458 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:24:29,459 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:24:29,459 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:41 [2020-06-22 08:24:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:32,533 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:24:32,543 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:24:32,544 INFO L98 LoopCannibalizer]: 15 predicates before loop cannibalization 16 predicates after loop cannibalization [2020-06-22 08:24:32,544 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 16 loop predicates [2020-06-22 08:24:32,544 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 39 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-06-22 08:24:35,710 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 39 transitions. cyclomatic complexity: 24. Second operand 11 states. Result 28 states and 52 transitions. Complement of second has 19 states. [2020-06-22 08:24:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 08:24:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 08:24:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-06-22 08:24:35,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 08:24:35,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:35,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 08:24:35,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:35,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 08:24:35,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:24:35,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 52 transitions. [2020-06-22 08:24:35,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:24:35,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-06-22 08:24:35,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:24:35,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:24:35,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:24:35,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:24:35,723 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:24:35,723 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:24:35,723 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:24:35,723 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:24:35,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:24:35,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:24:35,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:24:35,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:24:35 BasicIcfg [2020-06-22 08:24:35,729 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:24:35,730 INFO L168 Benchmark]: Toolchain (without parser) took 56343.24 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 406.3 MB). Free memory was 564.2 MB in the beginning and 791.1 MB in the end (delta: -226.9 MB). Peak memory consumption was 179.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,730 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:24:35,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.01 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 564.2 MB in the beginning and 632.5 MB in the end (delta: -68.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 667.9 MB. Free memory was 632.5 MB in the beginning and 629.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,732 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 667.9 MB. Free memory was 629.8 MB in the beginning and 628.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,732 INFO L168 Benchmark]: RCFGBuilder took 328.94 ms. Allocated memory is still 667.9 MB. Free memory was 628.5 MB in the beginning and 603.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,732 INFO L168 Benchmark]: BlockEncodingV2 took 145.59 ms. Allocated memory is still 667.9 MB. Free memory was 603.6 MB in the beginning and 584.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,733 INFO L168 Benchmark]: TraceAbstraction took 2613.27 ms. Allocated memory was 667.9 MB in the beginning and 741.9 MB in the end (delta: 73.9 MB). Free memory was 584.7 MB in the beginning and 606.5 MB in the end (delta: -21.8 MB). Peak memory consumption was 52.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,734 INFO L168 Benchmark]: BuchiAutomizer took 52895.30 ms. Allocated memory was 741.9 MB in the beginning and 1.1 GB in the end (delta: 314.0 MB). Free memory was 606.5 MB in the beginning and 791.1 MB in the end (delta: -184.6 MB). Peak memory consumption was 129.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:24:35,737 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 46 edges - StatisticsResult: Encoded RCFG 37 locations, 93 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 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 292.01 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 564.2 MB in the beginning and 632.5 MB in the end (delta: -68.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 667.9 MB. Free memory was 632.5 MB in the beginning and 629.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.38 ms. Allocated memory is still 667.9 MB. Free memory was 629.8 MB in the beginning and 628.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 328.94 ms. Allocated memory is still 667.9 MB. Free memory was 628.5 MB in the beginning and 603.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 145.59 ms. Allocated memory is still 667.9 MB. Free memory was 603.6 MB in the beginning and 584.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2613.27 ms. Allocated memory was 667.9 MB in the beginning and 741.9 MB in the end (delta: 73.9 MB). Free memory was 584.7 MB in the beginning and 606.5 MB in the end (delta: -21.8 MB). Peak memory consumption was 52.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 52895.30 ms. Allocated memory was 741.9 MB in the beginning and 1.1 GB in the end (delta: 314.0 MB). Free memory was 606.5 MB in the beginning and 791.1 MB in the end (delta: -184.6 MB). Peak memory consumption was 129.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: 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: 18]: 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: 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: 17]: 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: 18]: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 20 error locations. SAFE Result, 2.5s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 286 SDslu, 32 SDs, 0 SdLazy, 648 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 38 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 40 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.7s. Construction of modules took 1.6s. Büchi inclusion checks took 43.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 279 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 63 SDtfs, 1072 SDslu, 365 SDs, 0 SdLazy, 1416 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax100 hnf100 lsp94 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:24:35.966 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check