./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.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 e150e83dea41703782a488455769a24bf6c8f600 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:22,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:22,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:22,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:22,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:22,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:22,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:22,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:22,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:22,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:22,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:22,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:22,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:22,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:22,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:22,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:22,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:22,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:22,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:22,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:22,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:22,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:22,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:22,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:22,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:22,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:22,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:22,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:22,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:22,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:22,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:22,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:22,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:22,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:22,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:22,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:22,712 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:22,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:22,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:22,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:22,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:22,740 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:22,741 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:22,741 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:22,741 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:22,741 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:22,741 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:22,742 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:22,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:22,743 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:22,743 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:22,743 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:22,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:22,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:22,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:22,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:22,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:22,745 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:22,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:22,745 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:22,745 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:22,745 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:22,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:22,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:22,748 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:22,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:22,748 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:22,749 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:22,750 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:22,750 INFO L133 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 -> e150e83dea41703782a488455769a24bf6c8f600 [2018-11-29 00:10:22,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:22,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:22,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:22,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:22,819 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:22,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-29 00:10:22,889 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fb4ca0a/9706d7c5f8844d479c7f8147fadc9118/FLAGf40ae21c7 [2018-11-29 00:10:23,377 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:23,378 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-29 00:10:23,383 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fb4ca0a/9706d7c5f8844d479c7f8147fadc9118/FLAGf40ae21c7 [2018-11-29 00:10:23,745 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fb4ca0a/9706d7c5f8844d479c7f8147fadc9118 [2018-11-29 00:10:23,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:23,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:23,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:23,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:23,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:23,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:23" (1/1) ... [2018-11-29 00:10:23,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1435883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:23, skipping insertion in model container [2018-11-29 00:10:23,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:23" (1/1) ... [2018-11-29 00:10:23,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:23,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:24,005 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:24,030 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:24,065 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:24,090 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:24,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24 WrapperNode [2018-11-29 00:10:24,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:24,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:24,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:24,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:24,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:24,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:24,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:24,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:24,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2018-11-29 00:10:24,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:24,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:24,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:24,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:24,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (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 [2018-11-29 00:10:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:24,997 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:24,997 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-29 00:10:24,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24 BoogieIcfgContainer [2018-11-29 00:10:24,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:24,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:25,000 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:25,004 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:25,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:25,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:23" (1/3) ... [2018-11-29 00:10:25,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e4d3ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:25, skipping insertion in model container [2018-11-29 00:10:25,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:25,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (2/3) ... [2018-11-29 00:10:25,008 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e4d3ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:25, skipping insertion in model container [2018-11-29 00:10:25,008 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:25,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24" (3/3) ... [2018-11-29 00:10:25,010 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-29 00:10:25,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:25,074 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:25,074 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:25,074 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:25,075 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:25,075 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:25,075 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:25,075 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:25,075 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:25,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-29 00:10:25,115 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:25,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:25,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:25,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:25,122 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:25,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-29 00:10:25,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:25,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:25,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:25,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:25,134 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 14#L23true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L9-3true [2018-11-29 00:10:25,134 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 28#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 7#L9-2true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 6#L9-3true [2018-11-29 00:10:25,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-29 00:10:25,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2018-11-29 00:10:25,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2018-11-29 00:10:25,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,462 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:25,762 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:25,971 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-29 00:10:26,073 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:26,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:26,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:26,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:26,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:26,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:26,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:26,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:26,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-29 00:10:26,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:26,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:26,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,392 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-29 00:10:26,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:27,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:27,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:27,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,316 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:27,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,321 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:27,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,480 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:27,550 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:10:27,551 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:27,553 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:27,555 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:27,556 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:27,556 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-29 00:10:27,634 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:27,648 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:27,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:27,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:27,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:27,772 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 [2018-11-29 00:10:27,773 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2018-11-29 00:10:27,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 57 states and 81 transitions. Complement of second has 8 states. [2018-11-29 00:10:27,850 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 [2018-11-29 00:10:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-29 00:10:27,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-29 00:10:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-29 00:10:27,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-29 00:10:27,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2018-11-29 00:10:27,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:27,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2018-11-29 00:10:27,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:10:27,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:10:27,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-11-29 00:10:27,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:27,873 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:10:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-11-29 00:10:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-29 00:10:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:10:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-29 00:10:27,904 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:10:27,904 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:10:27,905 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:27,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-29 00:10:27,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:27,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:27,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:27,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:27,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:27,907 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 156#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 157#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 147#L9-3 assume !(sep_~i~0 < ~N~0); 144#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 145#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 146#L9-8 [2018-11-29 00:10:27,908 INFO L796 eck$LassoCheckResult]: Loop: 146#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 154#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 155#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 146#L9-8 [2018-11-29 00:10:27,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2018-11-29 00:10:27,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:28,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:28,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:28,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:28,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2018-11-29 00:10:28,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,188 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:28,194 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:28,274 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2018-11-29 00:10:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:28,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-11-29 00:10:28,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2018-11-29 00:10:28,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:10:28,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:10:28,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-29 00:10:28,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:28,279 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-29 00:10:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-29 00:10:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-29 00:10:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:10:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-29 00:10:28,282 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-29 00:10:28,282 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-29 00:10:28,282 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:28,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-29 00:10:28,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:28,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:28,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:28,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:28,285 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 204#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 205#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 195#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 196#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 200#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 197#L9-3 assume !(sep_~i~0 < ~N~0); 192#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 193#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 194#L9-8 [2018-11-29 00:10:28,285 INFO L796 eck$LassoCheckResult]: Loop: 194#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 202#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 203#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 194#L9-8 [2018-11-29 00:10:28,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2018-11-29 00:10:28,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:28,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:28,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:28,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:28,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:28,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-29 00:10:28,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:28,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2018-11-29 00:10:28,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,719 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:28,722 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-29 00:10:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:28,815 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-11-29 00:10:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:28,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2018-11-29 00:10:28,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2018-11-29 00:10:28,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:10:28,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:10:28,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-29 00:10:28,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:28,822 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:10:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-29 00:10:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-29 00:10:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:10:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-29 00:10:28,825 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-29 00:10:28,825 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-29 00:10:28,825 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:28,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-29 00:10:28,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:28,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:28,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:28,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:28,827 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 284#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 285#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 273#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 274#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 279#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 275#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 276#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 289#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 290#L9-3 assume !(sep_~i~0 < ~N~0); 270#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 271#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 272#L9-8 [2018-11-29 00:10:28,828 INFO L796 eck$LassoCheckResult]: Loop: 272#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 281#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 282#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 272#L9-8 [2018-11-29 00:10:28,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2018-11-29 00:10:28,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2018-11-29 00:10:28,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2018-11-29 00:10:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:29,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:29,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:29,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:29,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:30,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-29 00:10:30,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-29 00:10:30,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-29 00:10:30,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,287 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-29 00:10:30,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-29 00:10:30,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-29 00:10:30,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:30,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-29 00:10:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:30,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:30,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-11-29 00:10:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-29 00:10:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-29 00:10:30,475 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-29 00:10:30,782 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-29 00:10:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:32,440 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-29 00:10:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-29 00:10:32,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2018-11-29 00:10:32,444 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-29 00:10:32,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 101 transitions. [2018-11-29 00:10:32,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-29 00:10:32,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-29 00:10:32,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2018-11-29 00:10:32,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:32,450 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2018-11-29 00:10:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2018-11-29 00:10:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 31. [2018-11-29 00:10:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:10:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-11-29 00:10:32,455 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-29 00:10:32,455 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-29 00:10:32,455 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:32,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2018-11-29 00:10:32,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:32,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:32,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:32,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:32,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:32,458 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 462#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 463#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 451#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 452#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 458#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 453#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 454#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 468#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 470#L9-3 assume !(sep_~i~0 < ~N~0); 471#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 449#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 450#L9-8 [2018-11-29 00:10:32,458 INFO L796 eck$LassoCheckResult]: Loop: 450#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 469#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 460#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 450#L9-8 [2018-11-29 00:10:32,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2018-11-29 00:10:32,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2018-11-29 00:10:32,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2018-11-29 00:10:32,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,107 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 125 [2018-11-29 00:10:33,568 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-29 00:10:33,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:33,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:33,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:33,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:33,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:33,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:33,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:33,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:33,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-29 00:10:33,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:33,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:33,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,756 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-11-29 00:10:33,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:33,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:34,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:34,242 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:34,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:34,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:34,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:34,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:34,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:34,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:34,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:34,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:34,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:34,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:34,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:34,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:34,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:34,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:34,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:34,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:34,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:34,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:34,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:34,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,276 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:34,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:34,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:34,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:34,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:34,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:34,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:34,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:34,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:34,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:34,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:34,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:34,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:34,338 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:34,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:34,339 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:34,339 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:34,339 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-29 00:10:34,446 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:34,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:34,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:34,501 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 [2018-11-29 00:10:34,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-29 00:10:34,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2018-11-29 00:10:34,580 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 [2018-11-29 00:10:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-29 00:10:34,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:10:34,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:34,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:10:34,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:34,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-29 00:10:34,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:34,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2018-11-29 00:10:34,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:34,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2018-11-29 00:10:34,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:10:34,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:10:34,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2018-11-29 00:10:34,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:34,587 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-29 00:10:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2018-11-29 00:10:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-29 00:10:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-29 00:10:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-29 00:10:34,590 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-29 00:10:34,590 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-29 00:10:34,590 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:34,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-11-29 00:10:34,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:34,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:34,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:34,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:34,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:34,596 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 618#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 619#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 607#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 608#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 614#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 609#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 610#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 629#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 627#L9-3 assume !(sep_~i~0 < ~N~0); 626#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 605#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 606#L9-8 assume !(sep_~i~0 < ~N~0); 620#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 601#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 602#L35-3 [2018-11-29 00:10:34,597 INFO L796 eck$LassoCheckResult]: Loop: 602#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 621#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 602#L35-3 [2018-11-29 00:10:34,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2018-11-29 00:10:34,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:34,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:34,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:34,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:10:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:34,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:34,773 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:34,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2018-11-29 00:10:34,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:34,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:34,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:34,986 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:35,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:10:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:10:35,005 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-29 00:10:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:35,048 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-11-29 00:10:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:35,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2018-11-29 00:10:35,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:35,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2018-11-29 00:10:35,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-29 00:10:35,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-29 00:10:35,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-11-29 00:10:35,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:35,054 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-11-29 00:10:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-11-29 00:10:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-29 00:10:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-29 00:10:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-11-29 00:10:35,058 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-29 00:10:35,058 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-29 00:10:35,058 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:35,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2018-11-29 00:10:35,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:35,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:35,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:35,059 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:35,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:35,060 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 692#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 693#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 682#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 683#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 688#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 684#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 685#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 707#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 700#L9-3 assume !(sep_~i~0 < ~N~0); 701#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 706#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 705#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 699#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 691#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 698#L9-8 assume !(sep_~i~0 < ~N~0); 696#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 677#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 678#L35-3 [2018-11-29 00:10:35,060 INFO L796 eck$LassoCheckResult]: Loop: 678#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 697#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 678#L35-3 [2018-11-29 00:10:35,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2018-11-29 00:10:35,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:35,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:35,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:35,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:10:35,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:35,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:35,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:10:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:35,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-29 00:10:35,556 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:35,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2018-11-29 00:10:35,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:35,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:35,935 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:36,115 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-29 00:10:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:36,116 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-29 00:10:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:36,569 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2018-11-29 00:10:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:36,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2018-11-29 00:10:36,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:36,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2018-11-29 00:10:36,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-29 00:10:36,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-29 00:10:36,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2018-11-29 00:10:36,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:36,572 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-29 00:10:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2018-11-29 00:10:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-11-29 00:10:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-29 00:10:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-11-29 00:10:36,577 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-29 00:10:36,577 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-29 00:10:36,577 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:36,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2018-11-29 00:10:36,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:36,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:36,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:36,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:36,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:36,579 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 833#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 834#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 822#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 823#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 847#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 824#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 825#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 840#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 851#L9-3 assume !(sep_~i~0 < ~N~0); 850#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 849#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 848#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 846#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 843#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 842#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 831#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 832#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 844#L9-8 assume !(sep_~i~0 < ~N~0); 837#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 817#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 818#L35-3 [2018-11-29 00:10:36,579 INFO L796 eck$LassoCheckResult]: Loop: 818#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 838#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 818#L35-3 [2018-11-29 00:10:36,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2018-11-29 00:10:36,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:36,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:36,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:37,006 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-11-29 00:10:37,184 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-11-29 00:10:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:38,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:38,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:38,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:38,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:38,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:38,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-29 00:10:38,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-29 00:10:38,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-29 00:10:38,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2018-11-29 00:10:38,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-29 00:10:38,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-29 00:10:38,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:38,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-29 00:10:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-29 00:10:38,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:38,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-11-29 00:10:38,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:38,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2018-11-29 00:10:38,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:38,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:38,523 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-29 00:10:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-11-29 00:10:38,539 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand 22 states. [2018-11-29 00:10:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:39,855 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2018-11-29 00:10:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-29 00:10:39,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 89 transitions. [2018-11-29 00:10:39,859 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2018-11-29 00:10:39,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 89 transitions. [2018-11-29 00:10:39,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-29 00:10:39,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-29 00:10:39,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 89 transitions. [2018-11-29 00:10:39,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:39,863 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-11-29 00:10:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 89 transitions. [2018-11-29 00:10:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 35. [2018-11-29 00:10:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-29 00:10:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-29 00:10:39,867 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-29 00:10:39,867 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-29 00:10:39,867 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:10:39,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-29 00:10:39,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-29 00:10:39,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:39,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:39,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:39,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:39,869 INFO L794 eck$LassoCheckResult]: Stem: 1049#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1046#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1047#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1036#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1037#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1043#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1038#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1039#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1064#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1058#L9-3 assume !(sep_~i~0 < ~N~0); 1059#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1034#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1035#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1063#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1057#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1056#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1044#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1045#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1062#L9-8 assume !(sep_~i~0 < ~N~0); 1050#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1030#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1031#L35-3 [2018-11-29 00:10:39,869 INFO L796 eck$LassoCheckResult]: Loop: 1031#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1051#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1031#L35-3 [2018-11-29 00:10:39,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2018-11-29 00:10:39,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2018-11-29 00:10:39,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2018-11-29 00:10:39,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,056 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:40,795 WARN L180 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 165 [2018-11-29 00:10:41,225 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2018-11-29 00:10:41,227 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:41,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:41,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:41,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:41,228 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:41,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:41,228 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:41,228 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:41,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-29 00:10:41,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:41,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:41,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,729 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-11-29 00:10:41,876 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-29 00:10:42,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:42,327 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:42,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:42,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:42,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:42,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,411 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:42,427 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:42,428 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:10:42,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:42,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:42,433 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:42,433 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#x~0.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~1) = -1*ULTIMATE.start_main_~#x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-29 00:10:42,717 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-29 00:10:42,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:43,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:43,137 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 [2018-11-29 00:10:43,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-29 00:10:43,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 41 states and 56 transitions. Complement of second has 6 states. [2018-11-29 00:10:43,165 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 [2018-11-29 00:10:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-29 00:10:43,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-29 00:10:43,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:43,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-29 00:10:43,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:43,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-29 00:10:43,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:43,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2018-11-29 00:10:43,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:43,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 47 transitions. [2018-11-29 00:10:43,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:10:43,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:10:43,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2018-11-29 00:10:43,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:43,171 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-29 00:10:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2018-11-29 00:10:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-29 00:10:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-29 00:10:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-29 00:10:43,174 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-29 00:10:43,174 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-29 00:10:43,174 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:10:43,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2018-11-29 00:10:43,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:43,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:43,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:43,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:43,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:43,179 INFO L794 eck$LassoCheckResult]: Stem: 1254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1250#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1251#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1239#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1240#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1246#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1241#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1242#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1267#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1268#L9-3 assume !(sep_~i~0 < ~N~0); 1236#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1237#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1238#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1256#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1259#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1257#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1247#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1248#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1258#L9-8 assume !(sep_~i~0 < ~N~0); 1255#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1234#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1235#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1249#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1243#L9-13 [2018-11-29 00:10:43,180 INFO L796 eck$LassoCheckResult]: Loop: 1243#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1244#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1245#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1243#L9-13 [2018-11-29 00:10:43,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2018-11-29 00:10:43,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-29 00:10:43,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:43,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:43,286 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:43,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2018-11-29 00:10:43,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:10:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:10:43,430 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-29 00:10:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:43,457 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-29 00:10:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:43,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-29 00:10:43,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:43,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2018-11-29 00:10:43,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:10:43,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:10:43,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2018-11-29 00:10:43,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:43,462 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-29 00:10:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2018-11-29 00:10:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-29 00:10:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-29 00:10:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-11-29 00:10:43,466 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-29 00:10:43,466 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-29 00:10:43,466 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:10:43,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2018-11-29 00:10:43,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:43,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:43,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:43,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:43,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:43,473 INFO L794 eck$LassoCheckResult]: Stem: 1336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1331#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1332#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1319#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1320#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1349#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1321#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1322#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1348#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1346#L9-3 assume !(sep_~i~0 < ~N~0); 1345#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1344#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1343#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1342#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1340#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1339#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1328#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1329#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1341#L9-8 assume !(sep_~i~0 < ~N~0); 1333#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1314#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1315#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1334#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1335#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1330#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1323#L9-13 [2018-11-29 00:10:43,473 INFO L796 eck$LassoCheckResult]: Loop: 1323#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1324#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1327#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1323#L9-13 [2018-11-29 00:10:43,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2018-11-29 00:10:43,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2018-11-29 00:10:43,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2018-11-29 00:10:43,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,150 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2018-11-29 00:10:44,601 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-11-29 00:10:44,804 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2018-11-29 00:10:45,269 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2018-11-29 00:10:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:10:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:45,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:45,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:45,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:45,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-29 00:10:45,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-29 00:10:45,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-11-29 00:10:45,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-29 00:10:45,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-29 00:10:45,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,583 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2018-11-29 00:10:45,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-29 00:10:45,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-29 00:10:45,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-29 00:10:45,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-29 00:10:45,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-29 00:10:45,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-29 00:10:45,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 48 [2018-11-29 00:10:45,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-29 00:10:45,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-29 00:10:45,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-29 00:10:45,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:46 [2018-11-29 00:10:45,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-29 00:10:45,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-29 00:10:45,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-29 00:10:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-29 00:10:46,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:46,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2018-11-29 00:10:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-29 00:10:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-29 00:10:46,107 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-11-29 00:10:47,888 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-29 00:10:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:48,406 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2018-11-29 00:10:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-29 00:10:48,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 126 transitions. [2018-11-29 00:10:48,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-29 00:10:48,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 126 transitions. [2018-11-29 00:10:48,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-29 00:10:48,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-29 00:10:48,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 126 transitions. [2018-11-29 00:10:48,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:48,411 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 126 transitions. [2018-11-29 00:10:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 126 transitions. [2018-11-29 00:10:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2018-11-29 00:10:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:10:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-11-29 00:10:48,419 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-29 00:10:48,419 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-29 00:10:48,419 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:10:48,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2018-11-29 00:10:48,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:48,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:48,422 INFO L794 eck$LassoCheckResult]: Stem: 1614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1608#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1609#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1595#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1596#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1603#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1604#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1636#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1617#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1632#L9-3 assume !(sep_~i~0 < ~N~0); 1591#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1592#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1628#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1629#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1649#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1648#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1646#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1647#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1645#L9-8 assume !(sep_~i~0 < ~N~0); 1644#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1643#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1641#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1640#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1639#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1607#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1599#L9-13 [2018-11-29 00:10:48,423 INFO L796 eck$LassoCheckResult]: Loop: 1599#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1600#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1602#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1599#L9-13 [2018-11-29 00:10:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1953404899, now seen corresponding path program 1 times [2018-11-29 00:10:48,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,677 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-11-29 00:10:48,951 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-11-29 00:10:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:10:49,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:49,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-29 00:10:49,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-29 00:10:49,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-29 00:10:49,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,746 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-11-29 00:10:49,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-29 00:10:49,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-29 00:10:49,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:49,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-29 00:10:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-29 00:10:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-29 00:10:49,833 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:49,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2018-11-29 00:10:49,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:49,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:10:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:10:49,916 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. cyclomatic complexity: 27 Second operand 20 states. [2018-11-29 00:10:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:52,282 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-29 00:10:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-29 00:10:52,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 162 transitions. [2018-11-29 00:10:52,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-29 00:10:52,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 162 transitions. [2018-11-29 00:10:52,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-29 00:10:52,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-29 00:10:52,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 162 transitions. [2018-11-29 00:10:52,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:52,287 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 162 transitions. [2018-11-29 00:10:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 162 transitions. [2018-11-29 00:10:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-11-29 00:10:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-29 00:10:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2018-11-29 00:10:52,293 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 127 transitions. [2018-11-29 00:10:52,293 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 127 transitions. [2018-11-29 00:10:52,293 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:10:52,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 127 transitions. [2018-11-29 00:10:52,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:52,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:52,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:52,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:52,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:52,295 INFO L794 eck$LassoCheckResult]: Stem: 1971#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1963#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1964#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1951#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1952#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2002#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2001#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2000#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1957#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1953#L9-3 assume !(sep_~i~0 < ~N~0); 1948#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1949#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1950#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1973#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2043#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2042#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2041#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2040#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2038#L9-8 assume !(sep_~i~0 < ~N~0); 1965#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1946#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1947#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1984#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1983#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1962#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1955#L9-13 [2018-11-29 00:10:52,295 INFO L796 eck$LassoCheckResult]: Loop: 1955#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1956#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1959#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1955#L9-13 [2018-11-29 00:10:52,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash -462632739, now seen corresponding path program 2 times [2018-11-29 00:10:52,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 4 times [2018-11-29 00:10:52,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash 258193932, now seen corresponding path program 2 times [2018-11-29 00:10:52,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,590 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:53,814 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 252 DAG size of output: 198 [2018-11-29 00:10:54,483 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-29 00:10:54,485 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:54,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:54,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:54,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:54,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:54,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:54,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:54,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:54,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-29 00:10:54,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:54,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:54,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:54,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:55,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:55,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:55,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:55,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:55,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:55,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,208 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:55,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:55,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:55,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:55,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:55,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:55,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:55,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:55,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:55,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:55,263 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:55,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:55,288 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:55,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:55,288 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:55,291 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:55,291 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x.base)_4, ULTIMATE.start_sep_~x.offset, ULTIMATE.start_sep_~i~0) = 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_4 - 1*ULTIMATE.start_sep_~x.offset - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-29 00:10:55,396 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:55,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:55,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:55,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:55,803 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 [2018-11-29 00:10:55,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 127 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-29 00:10:55,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 127 transitions. cyclomatic complexity: 36. Second operand 3 states. Result 107 states and 136 transitions. Complement of second has 4 states. [2018-11-29 00:10:55,814 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 [2018-11-29 00:10:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-29 00:10:55,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-29 00:10:55,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-29 00:10:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-29 00:10:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 136 transitions. [2018-11-29 00:10:55,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:55,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 0 states and 0 transitions. [2018-11-29 00:10:55,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:55,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:55,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:55,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:55,818 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,818 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,818 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,819 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:10:55,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:55,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:55,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:55,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:55 BoogieIcfgContainer [2018-11-29 00:10:55,834 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:55,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:55,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:55,835 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:55,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24" (3/4) ... [2018-11-29 00:10:55,839 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:55,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:55,839 INFO L168 Benchmark]: Toolchain (without parser) took 32090.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 954.0 MB in the beginning and 941.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,840 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:55,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.83 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:55,842 INFO L168 Benchmark]: Boogie Preprocessor took 54.34 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,843 INFO L168 Benchmark]: RCFGBuilder took 786.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 937.9 MB in the beginning and 1.0 GB in the end (delta: -110.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,843 INFO L168 Benchmark]: BuchiAutomizer took 30834.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 219.2 MB). Free memory was 1.0 GB in the beginning and 941.0 MB in the end (delta: 107.8 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,848 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:55,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.83 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.34 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 786.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 937.9 MB in the beginning and 1.0 GB in the end (delta: -110.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30834.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 219.2 MB). Free memory was 1.0 GB in the beginning and 941.0 MB in the end (delta: 107.8 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 941.0 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 - 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 13 terminating modules (9 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.7s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 20.6s. Construction of modules took 4.2s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 102 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 260 SDtfs, 516 SDslu, 788 SDs, 0 SdLazy, 2198 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital184 mio100 ax100 hnf99 lsp89 ukn71 mio100 lsp60 div100 bol100 ite100 ukn100 eq167 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 3 VariablesLoop: 2 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...