./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/reducercommutativity/sum.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash e17f830a1ee9b998b40fe12c0d4d25b23cde3738 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:24:55,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:24:55,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:24:55,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:24:55,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:24:55,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:24:55,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:24:55,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:24:55,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:24:55,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:24:55,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:24:55,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:24:55,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:24:55,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:24:55,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:24:55,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:24:55,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:24:55,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:24:55,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:24:55,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:24:55,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:24:55,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:24:55,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:24:55,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:24:55,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:24:55,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:24:55,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:24:55,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:24:55,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:24:55,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:24:55,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:24:55,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:24:55,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:24:55,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:24:55,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:24:55,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:24:55,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:24:55,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:24:55,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:24:55,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:24:55,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:24:55,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:24:55,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:24:55,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:24:55,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:24:55,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:24:55,360 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:24:55,361 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:24:55,361 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:24:55,361 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:24:55,362 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:24:55,362 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:24:55,362 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:24:55,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:24:55,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:24:55,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:24:55,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:24:55,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:24:55,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:24:55,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:24:55,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:24:55,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:24:55,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:24:55,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:24:55,366 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:24:55,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:24:55,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:24:55,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:24:55,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:24:55,367 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:24:55,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:24:55,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:24:55,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:24:55,369 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:24:55,370 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:24:55,370 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e17f830a1ee9b998b40fe12c0d4d25b23cde3738 [2019-11-28 21:24:55,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:24:55,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:24:55,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:24:55,702 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:24:55,703 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:24:55,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum.i [2019-11-28 21:24:55,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29062d639/08df3b1b96784e018d9ce0c0a8456170/FLAG0516ae435 [2019-11-28 21:24:56,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:24:56,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum.i [2019-11-28 21:24:56,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29062d639/08df3b1b96784e018d9ce0c0a8456170/FLAG0516ae435 [2019-11-28 21:24:56,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29062d639/08df3b1b96784e018d9ce0c0a8456170 [2019-11-28 21:24:56,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:24:56,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:24:56,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:24:56,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:24:56,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:24:56,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:56,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cffb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56, skipping insertion in model container [2019-11-28 21:24:56,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:56,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:24:56,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:24:56,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:24:56,908 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:24:56,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:24:56,972 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:24:56,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56 WrapperNode [2019-11-28 21:24:57,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:24:57,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:24:57,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:24:57,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:24:57,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:24:57,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:24:57,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:24:57,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:24:57,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (1/1) ... [2019-11-28 21:24:57,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:24:57,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:24:57,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:24:57,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:24:57,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (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 [2019-11-28 21:24:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:24:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:24:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:24:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:24:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:24:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:24:57,559 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:24:57,560 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 21:24:57,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:24:57 BoogieIcfgContainer [2019-11-28 21:24:57,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:24:57,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:24:57,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:24:57,566 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:24:57,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:57,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:24:56" (1/3) ... [2019-11-28 21:24:57,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2514fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:24:57, skipping insertion in model container [2019-11-28 21:24:57,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:57,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:56" (2/3) ... [2019-11-28 21:24:57,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2514fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:24:57, skipping insertion in model container [2019-11-28 21:24:57,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:57,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:24:57" (3/3) ... [2019-11-28 21:24:57,575 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum.i [2019-11-28 21:24:57,631 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:24:57,631 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:24:57,631 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:24:57,632 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:24:57,632 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:24:57,632 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:24:57,632 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:24:57,632 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:24:57,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 21:24:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 21:24:57,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:57,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:57,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 21:24:57,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:57,680 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:24:57,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 21:24:57,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 21:24:57,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:57,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:57,684 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 21:24:57,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:57,692 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 9#L11-3true [2019-11-28 21:24:57,693 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 12#L11-2true sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 9#L11-3true [2019-11-28 21:24:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 21:24:57,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:57,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615315308] [2019-11-28 21:24:57,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-11-28 21:24:57,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:57,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964016788] [2019-11-28 21:24:57,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-11-28 21:24:57,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:57,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4771357] [2019-11-28 21:24:57,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:57,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:58,151 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-28 21:24:58,220 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:58,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:58,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:58,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:58,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:58,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:58,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:58,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:58,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration1_Lasso [2019-11-28 21:24:58,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:58,223 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:58,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,426 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-28 21:24:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:58,812 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:58,819 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) [2019-11-28 21:24:58,836 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 [2019-11-28 21:24:58,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:58,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:58,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:58,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:58,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:58,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:58,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:58,852 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) [2019-11-28 21:24:58,886 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 [2019-11-28 21:24:58,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:58,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:58,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:58,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:58,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:58,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:58,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:58,898 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) [2019-11-28 21:24:58,925 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 [2019-11-28 21:24:58,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:58,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:58,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:58,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:58,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:58,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:58,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:58,935 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:58,955 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 [2019-11-28 21:24:58,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:58,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:58,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:58,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:58,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:58,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:58,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:58,966 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) [2019-11-28 21:24:58,982 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 [2019-11-28 21:24:58,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:58,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:58,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:58,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:58,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:58,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:58,995 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) [2019-11-28 21:24:59,012 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 [2019-11-28 21:24:59,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:59,018 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) [2019-11-28 21:24:59,036 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 [2019-11-28 21:24:59,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:59,045 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 [2019-11-28 21:24:59,067 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 [2019-11-28 21:24:59,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:59,079 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 [2019-11-28 21:24:59,094 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 [2019-11-28 21:24:59,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:59,102 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 [2019-11-28 21:24:59,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:24:59,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:59,120 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 [2019-11-28 21:24:59,134 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 [2019-11-28 21:24:59,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:59,141 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 [2019-11-28 21:24:59,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:24:59,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:59,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:59,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:59,156 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 [2019-11-28 21:24:59,166 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 [2019-11-28 21:24:59,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:59,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:59,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:59,178 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) [2019-11-28 21:24:59,192 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 [2019-11-28 21:24:59,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:59,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:59,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:59,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:59,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:59,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:59,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:24:59,278 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 21:24:59,278 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. 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) [2019-11-28 21:24:59,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:59,320 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:24:59,321 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:24:59,321 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x.base)_1, ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset) = 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 - 4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:24:59,388 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 21:24:59,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:24:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:59,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:24:59,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:59,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:24:59,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:59,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:24:59,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-28 21:24:59,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2019-11-28 21:24:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:24:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:24:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-28 21:24:59,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 21:24:59,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:59,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:24:59,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:59,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 21:24:59,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:59,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2019-11-28 21:24:59,646 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:24:59,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2019-11-28 21:24:59,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:24:59,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:24:59,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 21:24:59,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:24:59,665 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:24:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 21:24:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:24:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:24:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 21:24:59,699 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:24:59,700 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:24:59,700 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:24:59,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 21:24:59,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:24:59,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:59,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:59,703 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:24:59,703 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:59,703 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 140#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 136#L11-3 assume !(sum_~i~0 < ~N~0); 132#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 133#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 145#L11-8 [2019-11-28 21:24:59,704 INFO L796 eck$LassoCheckResult]: Loop: 145#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 146#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 145#L11-8 [2019-11-28 21:24:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2019-11-28 21:24:59,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:59,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637402424] [2019-11-28 21:24:59,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:59,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637402424] [2019-11-28 21:24:59,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:24:59,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:24:59,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076961324] [2019-11-28 21:24:59,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:24:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-11-28 21:24:59,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:59,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475186700] [2019-11-28 21:24:59,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:59,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:59,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:24:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:24:59,875 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 21:24:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:59,917 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-28 21:24:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:24:59,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-28 21:24:59,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:24:59,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-11-28 21:24:59,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:24:59,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:24:59,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 21:24:59,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:24:59,921 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 21:24:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 21:24:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 21:24:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:24:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 21:24:59,923 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:24:59,923 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:24:59,923 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:24:59,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 21:24:59,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:24:59,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:59,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:59,925 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:59,925 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:59,926 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 182#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 181#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 177#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 178#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 179#L11-3 assume !(sum_~i~0 < ~N~0); 173#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 174#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 186#L11-8 [2019-11-28 21:24:59,926 INFO L796 eck$LassoCheckResult]: Loop: 186#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 187#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 186#L11-8 [2019-11-28 21:24:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2019-11-28 21:24:59,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:59,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360416919] [2019-11-28 21:24:59,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:59,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360416919] [2019-11-28 21:24:59,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132142363] [2019-11-28 21:24:59,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:00,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:00,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:00,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:00,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 21:25:00,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770263325] [2019-11-28 21:25:00,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:00,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:00,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2019-11-28 21:25:00,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:00,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494425099] [2019-11-28 21:25:00,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,087 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:00,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 21:25:00,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 21:25:00,123 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 21:25:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:00,172 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 21:25:00,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:25:00,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-28 21:25:00,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:00,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 21:25:00,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:25:00,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:00,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-28 21:25:00,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:00,175 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 21:25:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-28 21:25:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 21:25:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 21:25:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 21:25:00,178 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 21:25:00,178 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 21:25:00,178 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:00,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-11-28 21:25:00,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:00,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:00,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:00,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:00,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:00,180 INFO L794 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 250#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 249#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 244#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 245#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 256#L11-3 assume !(sum_~i~0 < ~N~0); 240#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 241#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 254#L11-8 [2019-11-28 21:25:00,181 INFO L796 eck$LassoCheckResult]: Loop: 254#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 255#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 254#L11-8 [2019-11-28 21:25:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2019-11-28 21:25:00,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:00,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386742462] [2019-11-28 21:25:00,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2019-11-28 21:25:00,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:00,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350766662] [2019-11-28 21:25:00,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2019-11-28 21:25:00,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:00,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994506361] [2019-11-28 21:25:00,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:00,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:00,749 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-11-28 21:25:01,000 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 21:25:01,003 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:01,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:01,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:01,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:01,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:01,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:01,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:01,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:01,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration4_Lasso [2019-11-28 21:25:01,005 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:01,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:01,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,442 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-28 21:25:01,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:01,939 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-28 21:25:02,004 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:02,005 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 21:25:02,015 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 [2019-11-28 21:25:02,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:02,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:02,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,030 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 [2019-11-28 21:25:02,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:02,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:02,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:02,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,045 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 [2019-11-28 21:25:02,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:02,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:02,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:02,052 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) [2019-11-28 21:25:02,068 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 [2019-11-28 21:25:02,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:02,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:02,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:02,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:02,108 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 [2019-11-28 21:25:02,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:02,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:02,131 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 [2019-11-28 21:25:02,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:02,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:02,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:02,145 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 [2019-11-28 21:25:02,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:02,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:02,169 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 [2019-11-28 21:25:02,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:02,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:02,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:02,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:02,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:02,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:02,227 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 21:25:02,227 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:02,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:02,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:02,237 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:02,237 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, v_rep(select #length ULTIMATE.start_sum_~x.base)_2) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_2 Supporting invariants [] [2019-11-28 21:25:02,254 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 21:25:02,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:02,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:02,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:02,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:02,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:02,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:02,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 21:25:02,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2019-11-28 21:25:02,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 21:25:02,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 21:25:02,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:02,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 21:25:02,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:02,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 21:25:02,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:02,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-28 21:25:02,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2019-11-28 21:25:02,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:25:02,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:02,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-28 21:25:02,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:02,348 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 21:25:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-28 21:25:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 21:25:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 21:25:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-28 21:25:02,350 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 21:25:02,350 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 21:25:02,350 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:02,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-11-28 21:25:02,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:02,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:02,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:02,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:02,352 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 371#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 370#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 365#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 366#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 367#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 368#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 378#L11-3 assume !(sum_~i~0 < ~N~0); 361#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 362#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 375#L11-8 assume !(sum_~i~0 < ~N~0); 373#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 374#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 363#L32-3 [2019-11-28 21:25:02,352 INFO L796 eck$LassoCheckResult]: Loop: 363#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 364#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 363#L32-3 [2019-11-28 21:25:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2019-11-28 21:25:02,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058270729] [2019-11-28 21:25:02,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:25:02,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058270729] [2019-11-28 21:25:02,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:02,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:02,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790914443] [2019-11-28 21:25:02,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2019-11-28 21:25:02,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958611943] [2019-11-28 21:25:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,400 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:02,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:02,467 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 21:25:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:02,511 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-11-28 21:25:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:02,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2019-11-28 21:25:02,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2019-11-28 21:25:02,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 21:25:02,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 21:25:02,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-11-28 21:25:02,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:02,514 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-28 21:25:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-11-28 21:25:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 21:25:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 21:25:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 21:25:02,524 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 21:25:02,524 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 21:25:02,524 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:25:02,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-28 21:25:02,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:02,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:02,527 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:02,527 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:02,527 INFO L794 eck$LassoCheckResult]: Stem: 422#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 421#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 420#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 415#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 416#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 417#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 418#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 428#L11-3 assume !(sum_~i~0 < ~N~0); 411#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 412#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 425#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 426#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 427#L11-8 assume !(sum_~i~0 < ~N~0); 423#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 424#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 413#L32-3 [2019-11-28 21:25:02,528 INFO L796 eck$LassoCheckResult]: Loop: 413#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 414#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 413#L32-3 [2019-11-28 21:25:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2019-11-28 21:25:02,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237596033] [2019-11-28 21:25:02,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:25:02,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237596033] [2019-11-28 21:25:02,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394798132] [2019-11-28 21:25:02,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:02,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:02,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:25:02,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:02,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 21:25:02,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190539072] [2019-11-28 21:25:02,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2019-11-28 21:25:02,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530666842] [2019-11-28 21:25:02,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:02,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:02,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 21:25:02,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 21:25:02,766 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-28 21:25:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:02,867 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-28 21:25:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:25:02,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2019-11-28 21:25:02,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2019-11-28 21:25:02,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 21:25:02,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 21:25:02,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-11-28 21:25:02,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:02,871 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 21:25:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-11-28 21:25:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-11-28 21:25:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 21:25:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 21:25:02,873 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 21:25:02,873 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 21:25:02,873 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:25:02,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-28 21:25:02,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:02,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:02,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:02,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:02,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:02,875 INFO L794 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 523#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 522#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 517#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 518#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 519#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 520#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 531#L11-3 assume !(sum_~i~0 < ~N~0); 513#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 514#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 527#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 528#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 529#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 530#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 532#L11-8 assume !(sum_~i~0 < ~N~0); 525#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 526#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 515#L32-3 [2019-11-28 21:25:02,876 INFO L796 eck$LassoCheckResult]: Loop: 515#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 516#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 515#L32-3 [2019-11-28 21:25:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2019-11-28 21:25:02,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887046392] [2019-11-28 21:25:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2019-11-28 21:25:02,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528335392] [2019-11-28 21:25:02,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:02,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2019-11-28 21:25:02,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:02,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460919946] [2019-11-28 21:25:02,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:03,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:25:03,729 WARN L192 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2019-11-28 21:25:04,414 WARN L192 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-28 21:25:04,417 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:04,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:04,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:04,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:04,417 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:04,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:04,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:04,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:04,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration7_Lasso [2019-11-28 21:25:04,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:04,418 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:04,575 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 21:25:05,076 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-11-28 21:25:05,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:05,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:05,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:05,503 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-28 21:25:06,197 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-11-28 21:25:06,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:06,308 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,315 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 [2019-11-28 21:25:06,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,324 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 [2019-11-28 21:25:06,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,335 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 [2019-11-28 21:25:06,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,350 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 [2019-11-28 21:25:06,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,362 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 [2019-11-28 21:25:06,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,375 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 [2019-11-28 21:25:06,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,388 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 [2019-11-28 21:25:06,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,407 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 [2019-11-28 21:25:06,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,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 [2019-11-28 21:25:06,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,429 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 [2019-11-28 21:25:06,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,470 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 [2019-11-28 21:25:06,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,481 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 [2019-11-28 21:25:06,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,490 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 [2019-11-28 21:25:06,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,503 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 [2019-11-28 21:25:06,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,505 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 21:25:06,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,528 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 21:25:06,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,551 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,564 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 [2019-11-28 21:25:06,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:06,654 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2019-11-28 21:25:06,655 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:06,661 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:25:06,662 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:06,662 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, ULTIMATE.start_main_~i~1) = 2*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 + 8 >= 0] [2019-11-28 21:25:06,700 INFO L297 tatePredicateManager]: 7 out of 10 supporting invariants were superfluous and have been removed [2019-11-28 21:25:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:06,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:25:06,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:06,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 21:25:06,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:06,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:06,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:06,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-28 21:25:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,019 WARN L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:25:07,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:07,047 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-28 21:25:07,047 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-28 21:25:07,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 11 states. Result 52 states and 64 transitions. Complement of second has 16 states. [2019-11-28 21:25:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 21:25:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 21:25:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2019-11-28 21:25:07,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 21:25:07,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:07,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-28 21:25:07,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:07,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-28 21:25:07,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:07,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2019-11-28 21:25:07,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:07,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 41 states and 48 transitions. [2019-11-28 21:25:07,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 21:25:07,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 21:25:07,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2019-11-28 21:25:07,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:07,576 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-28 21:25:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2019-11-28 21:25:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-11-28 21:25:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 21:25:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 21:25:07,580 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 21:25:07,580 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 21:25:07,580 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:25:07,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-28 21:25:07,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:07,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:07,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:07,581 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:07,582 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:07,582 INFO L794 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 757#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 756#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 751#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 752#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 753#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 754#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 778#L11-3 assume !(sum_~i~0 < ~N~0); 745#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 746#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 761#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 762#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 765#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 774#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 772#L11-8 assume !(sum_~i~0 < ~N~0); 769#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 768#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 767#L32-3 assume !(main_~i~1 < ~N~0 - 1); 743#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 744#L11-13 [2019-11-28 21:25:07,582 INFO L796 eck$LassoCheckResult]: Loop: 744#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 755#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 744#L11-13 [2019-11-28 21:25:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2019-11-28 21:25:07,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893424183] [2019-11-28 21:25:07,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 21:25:07,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893424183] [2019-11-28 21:25:07,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:07,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:07,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967521096] [2019-11-28 21:25:07,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-11-28 21:25:07,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645982628] [2019-11-28 21:25:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:07,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:07,664 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 21:25:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:07,695 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-28 21:25:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:07,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-11-28 21:25:07,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:07,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2019-11-28 21:25:07,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 21:25:07,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 21:25:07,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2019-11-28 21:25:07,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:07,698 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 21:25:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2019-11-28 21:25:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-28 21:25:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 21:25:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-11-28 21:25:07,701 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-28 21:25:07,701 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-28 21:25:07,701 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:25:07,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 42 transitions. [2019-11-28 21:25:07,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:07,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:07,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:07,702 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:07,703 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:07,703 INFO L794 eck$LassoCheckResult]: Stem: 841#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 840#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 839#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 832#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 833#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 834#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 835#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 857#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 856#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 855#L11-3 assume !(sum_~i~0 < ~N~0); 827#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 828#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 852#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 853#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 847#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 851#L11-8 assume !(sum_~i~0 < ~N~0); 842#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 843#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 844#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 836#L32-2 [2019-11-28 21:25:07,703 INFO L796 eck$LassoCheckResult]: Loop: 836#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 837#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 836#L32-2 [2019-11-28 21:25:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1001145849, now seen corresponding path program 1 times [2019-11-28 21:25:07,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115376249] [2019-11-28 21:25:07,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:07,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115376249] [2019-11-28 21:25:07,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936577898] [2019-11-28 21:25:07,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:25:07,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:07,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:07,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-28 21:25:07,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003199170] [2019-11-28 21:25:07,891 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2463, now seen corresponding path program 4 times [2019-11-28 21:25:07,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481746780] [2019-11-28 21:25:07,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:07,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:07,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 21:25:07,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-11-28 21:25:07,954 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. cyclomatic complexity: 10 Second operand 16 states. [2019-11-28 21:25:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:08,295 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 21:25:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 21:25:08,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 57 transitions. [2019-11-28 21:25:08,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:08,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 21:25:08,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 21:25:08,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 21:25:08,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2019-11-28 21:25:08,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:08,300 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 21:25:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2019-11-28 21:25:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2019-11-28 21:25:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 21:25:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-11-28 21:25:08,303 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 21:25:08,303 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 21:25:08,303 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:25:08,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2019-11-28 21:25:08,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:08,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:08,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:08,305 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:08,305 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:08,305 INFO L794 eck$LassoCheckResult]: Stem: 1026#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1025#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1024#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1018#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1019#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1020#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1046#L11-3 assume !(sum_~i~0 < ~N~0); 1045#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1044#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1043#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1033#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1034#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1042#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1039#L11-8 assume !(sum_~i~0 < ~N~0); 1038#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1037#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1036#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 1017#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 1016#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1010#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1011#L11-13 [2019-11-28 21:25:08,306 INFO L796 eck$LassoCheckResult]: Loop: 1011#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1011#L11-13 [2019-11-28 21:25:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2019-11-28 21:25:08,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89101309] [2019-11-28 21:25:08,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-11-28 21:25:08,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139667024] [2019-11-28 21:25:08,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2019-11-28 21:25:08,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317488085] [2019-11-28 21:25:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:09,464 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 224 DAG size of output: 177 [2019-11-28 21:25:10,823 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-11-28 21:25:10,825 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:10,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:10,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:10,826 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:10,826 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:10,826 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:10,826 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:10,826 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:10,826 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration10_Lasso [2019-11-28 21:25:10,826 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:10,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:10,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:10,934 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 21:25:11,464 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-11-28 21:25:11,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:11,854 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-28 21:25:12,192 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-28 21:25:12,213 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:12,213 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,219 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 [2019-11-28 21:25:12,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:12,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:12,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:12,223 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,231 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 [2019-11-28 21:25:12,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:12,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:12,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:12,236 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,242 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 [2019-11-28 21:25:12,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:12,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:12,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,247 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,253 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 [2019-11-28 21:25:12,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:12,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,267 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 [2019-11-28 21:25:12,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:12,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:12,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,272 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,279 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 [2019-11-28 21:25:12,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:12,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,286 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,293 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 [2019-11-28 21:25:12,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:12,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:12,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,298 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,304 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 [2019-11-28 21:25:12,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:12,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,322 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 [2019-11-28 21:25:12,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:12,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:12,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:12,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:12,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:12,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:12,363 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 21:25:12,363 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:12,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:12,371 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:12,371 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:12,371 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ~N~0) = -1*ULTIMATE.start_sum_~i~0 + 1*~N~0 Supporting invariants [] [2019-11-28 21:25:12,390 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 21:25:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:12,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:12,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:12,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:12,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:12,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:12,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 21:25:12,484 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 41 states and 47 transitions. Complement of second has 4 states. [2019-11-28 21:25:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 21:25:12,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-28 21:25:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-28 21:25:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-28 21:25:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:12,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2019-11-28 21:25:12,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:12,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 24 states and 26 transitions. [2019-11-28 21:25:12,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:25:12,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:25:12,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-28 21:25:12,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:12,491 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 21:25:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-28 21:25:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 21:25:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 21:25:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-28 21:25:12,493 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 21:25:12,493 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 21:25:12,493 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:25:12,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2019-11-28 21:25:12,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:12,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:12,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:12,495 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:12,495 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:12,495 INFO L794 eck$LassoCheckResult]: Stem: 1205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1204#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1203#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1199#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1200#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1201#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1202#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1213#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1212#L11-3 assume !(sum_~i~0 < ~N~0); 1195#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1196#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1208#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1210#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1216#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1215#L11-8 assume !(sum_~i~0 < ~N~0); 1206#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1207#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1197#L32-3 [2019-11-28 21:25:12,495 INFO L796 eck$LassoCheckResult]: Loop: 1197#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 1198#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 1197#L32-3 [2019-11-28 21:25:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash 972468242, now seen corresponding path program 3 times [2019-11-28 21:25:12,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:12,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868166597] [2019-11-28 21:25:12,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:12,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:12,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 5 times [2019-11-28 21:25:12,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:12,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699874573] [2019-11-28 21:25:12,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1760888524, now seen corresponding path program 2 times [2019-11-28 21:25:12,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:12,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185590115] [2019-11-28 21:25:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:12,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:13,439 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 159 [2019-11-28 21:25:14,289 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-11-28 21:25:14,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:14,310 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:14,310 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:14,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:14,310 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:14,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:14,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:14,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:14,311 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration11_Lasso [2019-11-28 21:25:14,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:14,311 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:14,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:14,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 21:25:15,155 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-11-28 21:25:15,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:15,632 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-28 21:25:16,340 WARN L192 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-28 21:25:16,443 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:16,443 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,447 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 [2019-11-28 21:25:16,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:16,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:16,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:16,451 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:16,458 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:16,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:16,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:16,462 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,467 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 [2019-11-28 21:25:16,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:16,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:16,473 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,481 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 [2019-11-28 21:25:16,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:16,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:16,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:16,484 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,490 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 [2019-11-28 21:25:16,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:16,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:16,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:16,493 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,499 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 [2019-11-28 21:25:16,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:16,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:16,509 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,514 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 [2019-11-28 21:25:16,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,516 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 21:25:16,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,530 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 21:25:16,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:16,554 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,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 [2019-11-28 21:25:16,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:16,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:16,568 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,574 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 [2019-11-28 21:25:16,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:16,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:16,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:16,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:16,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:16,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:16,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:16,635 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 21:25:16,635 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:16,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:16,641 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:16,641 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:16,641 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:25:16,694 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-28 21:25:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:16,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:16,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:16,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:16,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:16,759 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:16,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 21:25:16,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-11-28 21:25:16,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-28 21:25:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-28 21:25:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-28 21:25:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-28 21:25:16,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:16,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-28 21:25:16,770 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:16,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-28 21:25:16,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:25:16,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:25:16,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:25:16,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:16,772 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:16,772 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:16,772 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:16,772 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:25:16,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:25:16,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:16,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:25:16,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:25:16 BoogieIcfgContainer [2019-11-28 21:25:16,780 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:25:16,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:25:16,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:25:16,780 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:25:16,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:24:57" (3/4) ... [2019-11-28 21:25:16,785 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:25:16,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:25:16,786 INFO L168 Benchmark]: Toolchain (without parser) took 20192.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 957.7 MB in the beginning and 997.6 MB in the end (delta: -39.9 MB). Peak memory consumption was 348.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:16,787 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:16,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:16,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.73 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. [2019-11-28 21:25:16,788 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:16,789 INFO L168 Benchmark]: RCFGBuilder took 435.43 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:16,789 INFO L168 Benchmark]: BuchiAutomizer took 19217.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 103.8 MB). Peak memory consumption was 355.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:16,790 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.4 GB. Free memory is still 997.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:16,792 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.73 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. * Boogie Preprocessor took 29.95 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.43 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19217.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 103.8 MB). Peak memory consumption was 355.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.4 GB. Free memory is still 997.6 MB. 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -1 * x + -4 * i and consists of 13 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 16.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 9. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 186 SDslu, 96 SDs, 0 SdLazy, 442 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp110 ukn64 mio100 lsp52 div103 bol100 ite100 ukn100 eq167 hnf80 smp80 dnf221 smp59 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 17 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...