./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/c.07-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 b6b0b5eb73c85bd27f01305782cc76399fba05e9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:35:11,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:11,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:11,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:11,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:11,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:11,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:11,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:11,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:11,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:11,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:11,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:11,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:11,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:11,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:11,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:11,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:11,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:11,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:11,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:11,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:11,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:11,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:11,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:11,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:11,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:11,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:11,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:11,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:11,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:11,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:11,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:11,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:11,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:11,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:11,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:11,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:11,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:11,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:11,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:11,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:11,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:35:11,451 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:11,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:11,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:11,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:11,454 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:11,454 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:11,454 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:11,455 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:11,455 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:11,455 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:11,455 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:11,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:11,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:11,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:11,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:11,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:11,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:11,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:11,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:11,458 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:11,458 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:11,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:11,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:11,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:11,459 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:11,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:11,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:11,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:11,461 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:11,462 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:11,462 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 -> b6b0b5eb73c85bd27f01305782cc76399fba05e9 [2020-07-29 01:35:11,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:11,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:11,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:11,801 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:11,802 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:11,803 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2020-07-29 01:35:11,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4864273ce/446634e5bab74e1680b5a60d8286307c/FLAGad0cda1bc [2020-07-29 01:35:12,384 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:12,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2020-07-29 01:35:12,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4864273ce/446634e5bab74e1680b5a60d8286307c/FLAGad0cda1bc [2020-07-29 01:35:12,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4864273ce/446634e5bab74e1680b5a60d8286307c [2020-07-29 01:35:12,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:12,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:12,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:12,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:12,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:12,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:12" (1/1) ... [2020-07-29 01:35:12,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659c5cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:12, skipping insertion in model container [2020-07-29 01:35:12,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:12" (1/1) ... [2020-07-29 01:35:12,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:12,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:13,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:13,258 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:13,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:13,393 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:13,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13 WrapperNode [2020-07-29 01:35:13,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:13,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:13,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:13,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:13,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:13,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:13,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:13,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:13,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:13,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:13,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:13,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:13,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (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-07-29 01:35:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:13,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:14,166 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:14,166 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:35:14,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:14 BoogieIcfgContainer [2020-07-29 01:35:14,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:14,170 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:14,170 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:14,174 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:14,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:14,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:12" (1/3) ... [2020-07-29 01:35:14,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4889245b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:14, skipping insertion in model container [2020-07-29 01:35:14,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:14,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13" (2/3) ... [2020-07-29 01:35:14,177 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4889245b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:14, skipping insertion in model container [2020-07-29 01:35:14,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:14,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:14" (3/3) ... [2020-07-29 01:35:14,180 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.07-alloca.i [2020-07-29 01:35:14,223 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:14,224 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:14,224 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:14,224 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:14,224 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:14,225 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:14,225 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:14,225 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:14,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:35:14,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:14,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:35:14,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:14,265 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:14,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:35:14,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:14,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:35:14,269 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:14,276 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, 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~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_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_~j_ref~0.base, test_fun_~j_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_~k_ref~0.base, test_fun_~k_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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 8#L559-8true [2020-07-29 01:35:14,276 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-8true call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 5#L559-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 <= test_fun_~k; 9#L559-3true test_fun_#t~short11 := test_fun_#t~short9; 12#L559-4true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; 4#L559-6true assume !!test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15; 8#L559-8true [2020-07-29 01:35:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:35:14,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115274732] [2020-07-29 01:35:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,588 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 35405714, now seen corresponding path program 1 times [2020-07-29 01:35:14,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019911342] [2020-07-29 01:35:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845200, now seen corresponding path program 1 times [2020-07-29 01:35:14,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539743194] [2020-07-29 01:35:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:15,447 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2020-07-29 01:35:15,675 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-07-29 01:35:17,120 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 157 DAG size of output: 126 [2020-07-29 01:35:17,686 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-07-29 01:35:17,706 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:17,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:17,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:17,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:17,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:17,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:17,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:17,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:17,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.07-alloca.i_Iteration1_Lasso [2020-07-29 01:35:17,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:17,709 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:17,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:17,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:18,941 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 114 [2020-07-29 01:35:19,225 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2020-07-29 01:35:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:19,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:19,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:19,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:19,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-07-29 01:35:20,344 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-29 01:35:20,767 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:20,772 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,789 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-07-29 01:35:20,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,801 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,828 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-07-29 01:35:20,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,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 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-07-29 01:35:20,858 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-07-29 01:35:20,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,865 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,887 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-07-29 01:35:20,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,892 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-07-29 01:35:20,917 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-07-29 01:35:20,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,928 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-07-29 01:35:20,952 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-07-29 01:35:20,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,955 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-07-29 01:35:20,979 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-07-29 01:35:20,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,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 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-07-29 01:35:21,018 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-07-29 01:35:21,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:21,023 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-07-29 01:35:21,049 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-07-29 01:35:21,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:21,056 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,079 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-07-29 01:35:21,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,117 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-07-29 01:35:21,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,125 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,148 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-07-29 01:35:21,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:21,154 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,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-07-29 01:35:21,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,228 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-07-29 01:35:21,251 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-07-29 01:35:21,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,260 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) [2020-07-29 01:35:21,303 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-07-29 01:35:21,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,316 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-07-29 01:35:21,354 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-07-29 01:35:21,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,380 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) [2020-07-29 01:35:21,418 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,431 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) [2020-07-29 01:35:21,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-07-29 01:35:21,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 01:35:21,561 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-07-29 01:35:21,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,575 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) [2020-07-29 01:35:21,650 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-07-29 01:35:21,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,670 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) [2020-07-29 01:35:21,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 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:21,882 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:35:21,883 INFO L444 ModelExtractionUtils]: 20 out of 52 variables were initially zero. Simplification set additionally 27 variables to zero. 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-07-29 01:35:21,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:21,965 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:21,966 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:21,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1, ULTIMATE.start_test_fun_~k) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1 + 2*ULTIMATE.start_test_fun_~k + 201 Supporting invariants [] [2020-07-29 01:35:22,661 INFO L297 tatePredicateManager]: 54 out of 59 supporting invariants were superfluous and have been removed [2020-07-29 01:35:22,680 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100;" "assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 <= test_fun_~k;" "test_fun_#t~short11 := test_fun_#t~short9;" "assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648;" "assume !!test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15;" [2020-07-29 01:35:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,700 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:22,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:35:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:22,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2020-07-29 01:35:22,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, 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~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_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_~j_ref~0.base, test_fun_~j_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_~k_ref~0.base, test_fun_~k_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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {335#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) unseeded)} is VALID [2020-07-29 01:35:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:35:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:22,886 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:23,031 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:23,158 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:23,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)) (* 2 ULTIMATE.start_test_fun_~k) 201)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)))} call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; {347#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (or (not |ULTIMATE.start_test_fun_#t~short9|) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100)) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} is VALID [2020-07-29 01:35:23,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {347#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (or (not |ULTIMATE.start_test_fun_#t~short9|) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100)) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 <= test_fun_~k; {351#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (or (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not |ULTIMATE.start_test_fun_#t~short9|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} is VALID [2020-07-29 01:35:23,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {351#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (or (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not |ULTIMATE.start_test_fun_#t~short9|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} test_fun_#t~short11 := test_fun_#t~short9; {355#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (or (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not |ULTIMATE.start_test_fun_#t~short11|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} is VALID [2020-07-29 01:35:23,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {355#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (or (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not |ULTIMATE.start_test_fun_#t~short11|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; {359#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} is VALID [2020-07-29 01:35:23,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {359#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset) ULTIMATE.start_test_fun_~k) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset) 100) (<= (+ (* 2 ULTIMATE.start_test_fun_~k) 201) (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)))))} assume !!test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15; {338#(and (= |ULTIMATE.start_test_fun_#t~malloc2.base| ULTIMATE.start_test_fun_~i_ref~0.base) (not (= ULTIMATE.start_test_fun_~j_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~i_ref~0.base ULTIMATE.start_test_fun_~k_ref~0.base)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base ULTIMATE.start_test_fun_~j_ref~0.base)) (or (and (> oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)) (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)) (* 2 ULTIMATE.start_test_fun_~k) 201)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:23,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:35:23,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:23,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:35:23,392 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 6 states. [2020-07-29 01:35:23,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 6 states. Result 38 states and 49 transitions. Complement of second has 14 states. [2020-07-29 01:35:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:23,890 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:23,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:35:23,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:35:23,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:35:23,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2020-07-29 01:35:23,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,905 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 01:35:23,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,909 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:23,909 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:35:23,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:35:23,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:23,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 49 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:23,914 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:23,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:23,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:23,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:23,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:35:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:35:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:35:23,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:23,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:23,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:23,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:23,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:23,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:23,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:23,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:23,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:23,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:35:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:23,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:23,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:23,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:23,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:23,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:23,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:23,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:23,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:23,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,942 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:35:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2020-07-29 01:35:23,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:23,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:23,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 2 letters. Loop has 10 letters. [2020-07-29 01:35:23,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:23,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 19 states and 25 transitions. [2020-07-29 01:35:23,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:23,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:35:23,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-07-29 01:35:23,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:23,963 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:35:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-07-29 01:35:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-29 01:35:23,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:23,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second operand 17 states. [2020-07-29 01:35:23,995 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second operand 17 states. [2020-07-29 01:35:23,998 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2020-07-29 01:35:24,003 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:24,006 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-29 01:35:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:35:24,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:24,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:24,009 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states and 25 transitions. [2020-07-29 01:35:24,009 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states and 25 transitions. [2020-07-29 01:35:24,010 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:24,012 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2020-07-29 01:35:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2020-07-29 01:35:24,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:24,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:24,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:24,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:35:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:35:24,017 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:35:24,017 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:35:24,018 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:24,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:35:24,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:24,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:24,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:24,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:35:24,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:24,020 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 423#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, 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~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_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_~j_ref~0.base, test_fun_~j_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_~k_ref~0.base, test_fun_~k_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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 424#L559-8 call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 429#L559-1 [2020-07-29 01:35:24,020 INFO L796 eck$LassoCheckResult]: Loop: 429#L559-1 assume !test_fun_#t~short9; 430#L559-3 test_fun_#t~short11 := test_fun_#t~short9; 435#L559-4 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; 425#L559-6 assume !!test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15; 426#L559-8 call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 429#L559-1 [2020-07-29 01:35:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:35:24,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:24,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116972521] [2020-07-29 01:35:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash 40145596, now seen corresponding path program 1 times [2020-07-29 01:35:24,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:24,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421133472] [2020-07-29 01:35:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:24,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {520#true} assume !test_fun_#t~short9; {522#(not |ULTIMATE.start_test_fun_#t~short9|)} is VALID [2020-07-29 01:35:24,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#(not |ULTIMATE.start_test_fun_#t~short9|)} test_fun_#t~short11 := test_fun_#t~short9; {523#(not |ULTIMATE.start_test_fun_#t~short11|)} is VALID [2020-07-29 01:35:24,138 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#(not |ULTIMATE.start_test_fun_#t~short11|)} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; {521#false} is VALID [2020-07-29 01:35:24,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#false} assume !!test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15; {521#false} is VALID [2020-07-29 01:35:24,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#false} call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; {521#false} is VALID [2020-07-29 01:35:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:24,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421133472] [2020-07-29 01:35:24,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:24,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:35:24,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847947366] [2020-07-29 01:35:24,145 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:24,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:35:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:35:24,150 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:35:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:24,256 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 01:35:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:24,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:24,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:24,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2020-07-29 01:35:24,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-07-29 01:35:24,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:24,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:24,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:24,270 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,270 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,271 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,271 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:24,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,271 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:24,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:24 BoogieIcfgContainer [2020-07-29 01:35:24,279 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:24,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:24,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:24,280 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:24,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:14" (3/4) ... [2020-07-29 01:35:24,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:24,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:24,288 INFO L168 Benchmark]: Toolchain (without parser) took 11548.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 962.9 MB in the beginning and 1.2 GB in the end (delta: -220.0 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,289 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,291 INFO L168 Benchmark]: Boogie Preprocessor took 48.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,292 INFO L168 Benchmark]: RCFGBuilder took 635.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,293 INFO L168 Benchmark]: BuchiAutomizer took 10109.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,294 INFO L168 Benchmark]: Witness Printer took 5.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 653.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 635.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10109.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j_ref][j_ref] + -2 * unknown-#memory_int-unknown[i_ref][i_ref] + 2 * k + 201 and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 20 SDslu, 9 SDs, 0 SdLazy, 45 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital1050 mio100 ax101 hnf100 lsp97 ukn26 mio100 lsp36 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...