./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 72925b65ef321f719f00e79529e35268c3f3eaa3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:39:04,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:39:04,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:39:04,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:39:04,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:39:04,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:39:04,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:39:04,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:39:04,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:39:04,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:39:04,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:39:04,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:39:04,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:39:04,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:39:04,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:39:04,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:39:04,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:39:04,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:39:04,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:39:04,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:39:04,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:39:04,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:39:04,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:39:04,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:39:04,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:39:04,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:39:04,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:39:04,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:39:04,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:39:04,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:39:04,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:39:04,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:39:04,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:39:04,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:39:04,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:39:04,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:39:04,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:39:04,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:39:04,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:39:04,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:39:04,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:39:04,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:39:04,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:39:04,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:39:04,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:39:04,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:39:04,198 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:39:04,198 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:39:04,198 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:39:04,199 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:39:04,199 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:39:04,199 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:39:04,199 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:39:04,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:39:04,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:39:04,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:39:04,201 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:39:04,201 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:39:04,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:39:04,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:39:04,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:39:04,202 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:39:04,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:39:04,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:39:04,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:39:04,203 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:39:04,204 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:39:04,204 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2020-10-20 06:39:04,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:39:04,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:39:04,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:39:04,421 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:39:04,421 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:39:04,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-10-20 06:39:04,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f1ddf9c/c73fefbb0bbe41b79939b80d10196378/FLAG510dfb11e [2020-10-20 06:39:05,027 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:39:05,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-10-20 06:39:05,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f1ddf9c/c73fefbb0bbe41b79939b80d10196378/FLAG510dfb11e [2020-10-20 06:39:05,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f1ddf9c/c73fefbb0bbe41b79939b80d10196378 [2020-10-20 06:39:05,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:39:05,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:39:05,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:05,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:39:05,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:39:05,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5550ff93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05, skipping insertion in model container [2020-10-20 06:39:05,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:39:05,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:39:05,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:05,777 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:39:05,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:05,937 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:39:05,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05 WrapperNode [2020-10-20 06:39:05,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:05,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:05,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:39:05,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:39:05,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:05,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:39:05,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:39:05,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:39:05,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:05,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:06,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:06,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:06,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... [2020-10-20 06:39:06,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:39:06,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:39:06,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:39:06,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:39:06,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:39:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:39:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:39:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:39:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:39:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:39:06,414 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:39:06,414 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:39:06,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:06 BoogieIcfgContainer [2020-10-20 06:39:06,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:39:06,417 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:39:06,417 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:39:06,421 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:39:06,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:06,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:39:05" (1/3) ... [2020-10-20 06:39:06,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ba08d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:06, skipping insertion in model container [2020-10-20 06:39:06,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:06,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:05" (2/3) ... [2020-10-20 06:39:06,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ba08d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:06, skipping insertion in model container [2020-10-20 06:39:06,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:06,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:06" (3/3) ... [2020-10-20 06:39:06,426 INFO L373 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2020-10-20 06:39:06,472 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:39:06,473 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:39:06,473 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:39:06,473 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:39:06,473 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:39:06,474 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:39:06,474 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:39:06,474 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:39:06,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-10-20 06:39:06,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:06,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:06,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:06,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:06,520 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:06,520 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:39:06,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-10-20 06:39:06,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:06,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:06,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:06,523 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:06,523 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:06,529 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2020-10-20 06:39:06,530 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2020-10-20 06:39:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:39:06,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:06,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475788120] [2020-10-20 06:39:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2020-10-20 06:39:06,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:06,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017970198] [2020-10-20 06:39:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2020-10-20 06:39:06,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:06,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102320887] [2020-10-20 06:39:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:06,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:06,947 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:07,114 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-10-20 06:39:07,878 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2020-10-20 06:39:08,177 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-20 06:39:08,192 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:08,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:08,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:08,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:08,194 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:08,194 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:08,194 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:08,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:08,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2020-10-20 06:39:08,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:08,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:08,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:08,866 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2020-10-20 06:39:08,995 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-10-20 06:39:08,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:09,642 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:09,652 INFO L120 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-10-20 06:39:09,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:09,705 INFO L120 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-10-20 06:39:09,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,736 INFO L120 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-10-20 06:39:09,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:09,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:09,791 INFO L120 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-10-20 06:39:09,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,831 INFO L120 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-10-20 06:39:09,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:09,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,864 INFO L120 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-10-20 06:39:09,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:09,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:09,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,912 INFO L120 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-10-20 06:39:09,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:09,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,944 INFO L120 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-10-20 06:39:09,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:09,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:09,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:09,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,975 INFO L120 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-10-20 06:39:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:09,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:09,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:09,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:09,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:09,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,008 INFO L120 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 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,042 INFO L120 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-10-20 06:39:10,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:10,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:10,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:10,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,081 INFO L120 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-10-20 06:39:10,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,112 INFO L120 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 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,157 INFO L120 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-10-20 06:39:10,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,212 INFO L120 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-10-20 06:39:10,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,298 INFO L120 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-10-20 06:39:10,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,337 INFO L120 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-10-20 06:39:10,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,372 INFO L120 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-10-20 06:39:10,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,412 INFO L120 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-10-20 06:39:10,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,445 INFO L120 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-10-20 06:39:10,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,475 INFO L120 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-10-20 06:39:10,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,519 INFO L120 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-10-20 06:39:10,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,575 INFO L120 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-10-20 06:39:10,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,614 INFO L120 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-10-20 06:39:10,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:10,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:10,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:10,693 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:39:10,693 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:10,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,717 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:39:10,717 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:10,718 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~nondet20, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*ULTIMATE.start_main_#t~nondet20 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [-1*ULTIMATE.start_main_#t~nondet20 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 >= 0] [2020-10-20 06:39:10,946 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2020-10-20 06:39:10,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:11,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:39:11,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:39:11,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:11,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:11,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:11,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:39:11,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2020-10-20 06:39:11,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 48 states and 68 transitions. Complement of second has 10 states. [2020-10-20 06:39:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:39:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-20 06:39:11,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:39:11,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:11,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-20 06:39:11,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:11,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-20 06:39:11,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:11,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 68 transitions. [2020-10-20 06:39:11,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 06:39:11,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 30 states and 44 transitions. [2020-10-20 06:39:11,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 06:39:11,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 06:39:11,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2020-10-20 06:39:11,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:11,377 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-10-20 06:39:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2020-10-20 06:39:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-20 06:39:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 06:39:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-10-20 06:39:11,411 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-20 06:39:11,411 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-20 06:39:11,411 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:39:11,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-10-20 06:39:11,413 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 06:39:11,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:11,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:11,414 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:39:11,414 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:11,414 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 263#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 264#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 281#L557-1 [2020-10-20 06:39:11,414 INFO L796 eck$LassoCheckResult]: Loop: 281#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 278#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 279#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 274#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 276#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 281#L557-1 [2020-10-20 06:39:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-20 06:39:11,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091157] [2020-10-20 06:39:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,505 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2020-10-20 06:39:11,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060648871] [2020-10-20 06:39:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:11,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060648871] [2020-10-20 06:39:11,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:11,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:11,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875425795] [2020-10-20 06:39:11,578 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:11,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:11,582 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-20 06:39:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:11,631 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-10-20 06:39:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:11,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2020-10-20 06:39:11,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-20 06:39:11,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 44 transitions. [2020-10-20 06:39:11,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 06:39:11,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 06:39:11,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2020-10-20 06:39:11,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:11,636 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-20 06:39:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2020-10-20 06:39:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-10-20 06:39:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 06:39:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-10-20 06:39:11,640 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 06:39:11,640 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 06:39:11,640 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:39:11,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-10-20 06:39:11,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-20 06:39:11,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:11,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:11,641 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:11,641 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:11,642 INFO L794 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 338#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 339#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 357#L557-1 assume test_fun_#t~short10; 362#L557-3 [2020-10-20 06:39:11,642 INFO L796 eck$LassoCheckResult]: Loop: 362#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 359#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 360#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 365#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 364#L557-1 assume test_fun_#t~short10; 362#L557-3 [2020-10-20 06:39:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-20 06:39:11,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086619846] [2020-10-20 06:39:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,696 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 45964857, now seen corresponding path program 1 times [2020-10-20 06:39:11,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076221917] [2020-10-20 06:39:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:11,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076221917] [2020-10-20 06:39:11,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:11,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:39:11,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123766918] [2020-10-20 06:39:11,734 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:11,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:11,734 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-10-20 06:39:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:11,793 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-20 06:39:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:39:11,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2020-10-20 06:39:11,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:39:11,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 35 transitions. [2020-10-20 06:39:11,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 06:39:11,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 06:39:11,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-20 06:39:11,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:11,797 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-20 06:39:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-20 06:39:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-10-20 06:39:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:39:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-10-20 06:39:11,800 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-20 06:39:11,800 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-20 06:39:11,800 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:39:11,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-10-20 06:39:11,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:39:11,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:11,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:11,801 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:11,801 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:11,801 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 411#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 431#L557-3 [2020-10-20 06:39:11,801 INFO L796 eck$LassoCheckResult]: Loop: 431#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 427#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 422#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 430#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 431#L557-3 [2020-10-20 06:39:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-20 06:39:11,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637074632] [2020-10-20 06:39:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,842 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1480169, now seen corresponding path program 1 times [2020-10-20 06:39:11,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072350111] [2020-10-20 06:39:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:11,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:11,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 179595856, now seen corresponding path program 1 times [2020-10-20 06:39:11,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:11,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574190194] [2020-10-20 06:39:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:11,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574190194] [2020-10-20 06:39:11,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:11,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:39:11,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709481388] [2020-10-20 06:39:12,070 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2020-10-20 06:39:12,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:12,136 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-20 06:39:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:12,174 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-10-20 06:39:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:12,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-10-20 06:39:12,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:39:12,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 28 transitions. [2020-10-20 06:39:12,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 06:39:12,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 06:39:12,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-10-20 06:39:12,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:12,177 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-20 06:39:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-10-20 06:39:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-20 06:39:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 06:39:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-20 06:39:12,180 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 06:39:12,180 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 06:39:12,180 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:39:12,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-20 06:39:12,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-10-20 06:39:12,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:12,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:12,182 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:12,182 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:12,182 INFO L794 eck$LassoCheckResult]: Stem: 472#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 466#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 467#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 481#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 474#L557-3 [2020-10-20 06:39:12,182 INFO L796 eck$LassoCheckResult]: Loop: 474#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 479#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 477#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 478#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 484#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 474#L557-3 [2020-10-20 06:39:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-20 06:39:12,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628442098] [2020-10-20 06:39:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2020-10-20 06:39:12,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309592984] [2020-10-20 06:39:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,242 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2020-10-20 06:39:12,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959294599] [2020-10-20 06:39:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:12,467 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-10-20 06:39:13,561 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2020-10-20 06:39:13,919 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-20 06:39:13,923 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:13,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:13,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:13,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:13,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:13,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:13,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:13,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:13,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration5_Lasso [2020-10-20 06:39:13,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:13,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:13,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:13,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-10-20 06:39:15,336 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2020-10-20 06:39:15,585 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-10-20 06:39:15,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:16,021 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-10-20 06:39:16,797 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-20 06:39:17,039 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-10-20 06:39:17,106 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:17,106 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:17,122 INFO L120 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-10-20 06:39:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:17,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:17,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,152 INFO L120 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-10-20 06:39:17,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:17,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:17,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:17,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,179 INFO L120 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-10-20 06:39:17,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:17,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:17,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:17,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:17,206 INFO L120 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 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:17,235 INFO L120 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 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:17,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:17,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:17,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,284 INFO L120 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-10-20 06:39:17,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:17,313 INFO L120 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-10-20 06:39:17,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:17,351 INFO L120 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-10-20 06:39:17,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,393 INFO L120 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-10-20 06:39:17,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,425 INFO L120 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-10-20 06:39:17,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,453 INFO L120 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-10-20 06:39:17,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,484 INFO L120 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-10-20 06:39:17,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,533 INFO L120 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-10-20 06:39:17,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,562 INFO L120 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-10-20 06:39:17,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:17,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:17,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:17,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:17,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,597 INFO L120 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-10-20 06:39:17,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:17,599 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:39:17,599 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:39:17,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:17,630 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-20 06:39:17,630 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:39:17,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:17,824 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 06:39:17,825 INFO L444 ModelExtractionUtils]: 51 out of 91 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:17,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:39:17,830 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:39:17,831 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:17,831 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-10-20 06:39:18,046 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-10-20 06:39:18,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:18,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:18,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:18,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:18,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:39:18,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:18,326 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-10-20 06:39:18,328 INFO L350 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-10-20 06:39:18,329 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 113 [2020-10-20 06:39:18,337 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:39:18,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:18,342 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:39:18,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:18,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:18,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:18,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:18,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:18,491 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2020-10-20 06:39:18,492 INFO L625 ElimStorePlain]: treesize reduction 313, result has 46.9 percent of original size [2020-10-20 06:39:18,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,608 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-10-20 06:39:18,609 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:277 [2020-10-20 06:39:18,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:18,811 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-20 06:39:18,811 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-10-20 06:39:18,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2020-10-20 06:39:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:39:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-10-20 06:39:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-20 06:39:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-20 06:39:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-20 06:39:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:18,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2020-10-20 06:39:18,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-10-20 06:39:18,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 41 states and 53 transitions. [2020-10-20 06:39:18,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 06:39:18,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-20 06:39:18,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2020-10-20 06:39:18,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:18,881 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-20 06:39:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2020-10-20 06:39:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-20 06:39:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 06:39:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2020-10-20 06:39:18,888 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-20 06:39:18,888 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-10-20 06:39:18,888 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:39:18,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-10-20 06:39:18,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-10-20 06:39:18,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:18,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:18,891 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:39:18,891 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:18,893 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 738#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 739#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 766#L557-1 assume test_fun_#t~short10; 774#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 772#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 770#L561 [2020-10-20 06:39:18,893 INFO L796 eck$LassoCheckResult]: Loop: 770#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 769#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 773#L557-1 assume test_fun_#t~short10; 771#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 768#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 770#L561 [2020-10-20 06:39:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:18,893 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2020-10-20 06:39:18,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:18,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785396229] [2020-10-20 06:39:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:18,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785396229] [2020-10-20 06:39:18,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:18,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:18,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471400050] [2020-10-20 06:39:18,964 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:39:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 52859425, now seen corresponding path program 1 times [2020-10-20 06:39:18,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:18,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624976370] [2020-10-20 06:39:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:19,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624976370] [2020-10-20 06:39:19,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:19,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:19,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752753601] [2020-10-20 06:39:19,007 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:19,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:19,008 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-10-20 06:39:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:19,042 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-10-20 06:39:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:19,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2020-10-20 06:39:19,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:19,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 28 transitions. [2020-10-20 06:39:19,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 06:39:19,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 06:39:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-20 06:39:19,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:19,045 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-20 06:39:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-20 06:39:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-10-20 06:39:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:39:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-10-20 06:39:19,053 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 06:39:19,053 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 06:39:19,053 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:39:19,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-10-20 06:39:19,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:19,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:19,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:19,057 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:19,057 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:19,057 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 820#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 821#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 841#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 839#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 836#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 832#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 833#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 827#L557-1 assume test_fun_#t~short10; 828#L557-3 [2020-10-20 06:39:19,057 INFO L796 eck$LassoCheckResult]: Loop: 828#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 822#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 823#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 834#L557-1 assume test_fun_#t~short10; 828#L557-3 [2020-10-20 06:39:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2020-10-20 06:39:19,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833512915] [2020-10-20 06:39:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:19,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833512915] [2020-10-20 06:39:19,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792549122] [2020-10-20 06:39:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:39:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-20 06:39:19,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:19,231 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:19,232 INFO L384 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-10-20 06:39:19,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:19,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:19,239 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:19,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:19,252 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:19,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2020-10-20 06:39:19,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:19,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:19,343 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2020-10-20 06:39:19,344 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:19,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:19,354 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:19,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2020-10-20 06:39:19,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:19,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:19,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-20 06:39:19,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845248221] [2020-10-20 06:39:19,392 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:39:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2020-10-20 06:39:19,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490941752] [2020-10-20 06:39:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,404 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:19,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:39:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:39:19,515 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2020-10-20 06:39:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:19,587 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-20 06:39:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:39:19,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-20 06:39:19,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:19,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-10-20 06:39:19,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:39:19,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:39:19,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:39:19,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:19,595 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:19,595 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:19,595 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:19,595 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:39:19,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:39:19,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:19,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:39:19,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:39:19 BoogieIcfgContainer [2020-10-20 06:39:19,604 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:39:19,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:39:19,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:39:19,607 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:39:19,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:06" (3/4) ... [2020-10-20 06:39:19,612 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:39:19,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:39:19,614 INFO L168 Benchmark]: Toolchain (without parser) took 14272.38 ms. Allocated memory was 35.7 MB in the beginning and 114.8 MB in the end (delta: 79.2 MB). Free memory was 14.7 MB in the beginning and 46.8 MB in the end (delta: -32.1 MB). Peak memory consumption was 47.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,617 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 33.6 MB. Free memory was 9.7 MB in the beginning and 9.7 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.71 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 13.7 MB in the beginning and 28.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.03 ms. Allocated memory is still 46.7 MB. Free memory was 28.7 MB in the beginning and 26.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,619 INFO L168 Benchmark]: Boogie Preprocessor took 28.96 ms. Allocated memory is still 46.7 MB. Free memory was 26.7 MB in the beginning and 25.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,620 INFO L168 Benchmark]: RCFGBuilder took 402.91 ms. Allocated memory is still 46.7 MB. Free memory was 25.3 MB in the beginning and 20.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,623 INFO L168 Benchmark]: BuchiAutomizer took 13187.39 ms. Allocated memory was 46.7 MB in the beginning and 114.8 MB in the end (delta: 68.2 MB). Free memory was 20.3 MB in the beginning and 46.8 MB in the end (delta: -26.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:19,623 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 114.8 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:39:19,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 33.6 MB. Free memory was 9.7 MB in the beginning and 9.7 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 590.71 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 13.7 MB in the beginning and 28.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 44.03 ms. Allocated memory is still 46.7 MB. Free memory was 28.7 MB in the beginning and 26.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.96 ms. Allocated memory is still 46.7 MB. Free memory was 26.7 MB in the beginning and 25.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 402.91 ms. Allocated memory is still 46.7 MB. Free memory was 25.3 MB in the beginning and 20.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 13187.39 ms. Allocated memory was 46.7 MB in the beginning and 114.8 MB in the end (delta: 68.2 MB). Free memory was 20.3 MB in the beginning and 46.8 MB in the end (delta: -26.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 14.3 GB. * Witness Printer took 5.47 ms. Allocated memory is still 114.8 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 14.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-__VERIFIER_nondet_int()-aux + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 51 SDslu, 38 SDs, 0 SdLazy, 180 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital408 mio100 ax104 hnf99 lsp94 ukn70 mio100 lsp29 div100 bol104 ite100 ukn100 eq187 hnf88 smp97 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 239ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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! Received shutdown request...