./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum_false-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/rangesum_false-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 279fae57395782089eff32ec1396d1726d808c7f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:13,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:13,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:13,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:13,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:13,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:13,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:13,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:13,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:13,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:13,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:13,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:13,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:13,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:13,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:13,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:13,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:13,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:13,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:13,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:13,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:13,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:13,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:13,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:13,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:13,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:13,677 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:13,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:13,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:13,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:13,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:13,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:13,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:13,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:13,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:13,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:13,683 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:13,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:13,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:13,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:13,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:13,701 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:13,701 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:13,701 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:13,701 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:13,701 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:13,701 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:13,702 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:13,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:13,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:13,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:13,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:13,703 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:13,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:13,704 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:13,704 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:13,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:13,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:13,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:13,707 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:13,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:13,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:13,708 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:13,709 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:13,709 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 -> 279fae57395782089eff32ec1396d1726d808c7f [2018-11-29 00:10:13,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:13,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:13,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:13,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:13,770 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:13,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-29 00:10:13,831 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6d51c2d/c6aa28e0454f4f98943f5729591708ca/FLAG56b8b6cd5 [2018-11-29 00:10:14,282 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:14,283 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-29 00:10:14,290 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6d51c2d/c6aa28e0454f4f98943f5729591708ca/FLAG56b8b6cd5 [2018-11-29 00:10:14,623 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6d51c2d/c6aa28e0454f4f98943f5729591708ca [2018-11-29 00:10:14,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:14,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:14,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:14,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:14,635 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:14,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:14" (1/1) ... [2018-11-29 00:10:14,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e68a996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:14, skipping insertion in model container [2018-11-29 00:10:14,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:14" (1/1) ... [2018-11-29 00:10:14,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:14,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:14,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:14,916 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:14,965 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:14,988 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:14,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:14 WrapperNode [2018-11-29 00:10:14,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:14,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:14,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:14,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:15,001 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:14" (1/1) ... [2018-11-29 00:10:15,016 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:14" (1/1) ... [2018-11-29 00:10:15,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:15,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:15,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:15,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:15,089 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:14" (1/1) ... [2018-11-29 00:10:15,089 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:14" (1/1) ... [2018-11-29 00:10:15,094 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:14" (1/1) ... [2018-11-29 00:10:15,102 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:14" (1/1) ... [2018-11-29 00:10:15,117 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:14" (1/1) ... [2018-11-29 00:10:15,209 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:14" (1/1) ... [2018-11-29 00:10:15,214 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:14" (1/1) ... [2018-11-29 00:10:15,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:15,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:15,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:15,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:15,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:14" (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:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:15,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:15,862 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-29 00:10:15,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:15 BoogieIcfgContainer [2018-11-29 00:10:15,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:15,863 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:15,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:15,867 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:15,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:15,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:14" (1/3) ... [2018-11-29 00:10:15,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa5b34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:15, skipping insertion in model container [2018-11-29 00:10:15,870 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:15,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:14" (2/3) ... [2018-11-29 00:10:15,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa5b34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:15, skipping insertion in model container [2018-11-29 00:10:15,871 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:15,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:15" (3/3) ... [2018-11-29 00:10:15,872 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-11-29 00:10:15,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:15,935 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:15,935 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:15,936 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:15,936 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:15,936 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:15,937 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:15,937 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:15,937 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:15,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-29 00:10:15,982 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:15,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:15,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:15,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:15,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:15,989 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:15,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-29 00:10:15,992 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:15,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:15,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:15,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:15,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:16,001 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#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~2, 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; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 17#L7-3true [2018-11-29 00:10:16,001 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 6#L7-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 17#L7-3true [2018-11-29 00:10:16,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:16,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-29 00:10:16,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-29 00:10:16,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:16,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:16,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:16,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-29 00:10:16,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:16,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:16,499 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:10:16,684 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-29 00:10:16,695 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:16,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:16,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:16,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:16,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:16,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:16,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:16,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:16,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-29 00:10:16,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:16,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:16,726 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:16,752 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:16,755 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:16,776 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:16,784 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:16,795 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:17,074 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-29 00:10:17,141 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:17,144 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:17,158 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:17,163 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:17,166 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:17,168 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:17,171 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:17,182 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:17,185 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:17,191 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:17,194 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:17,228 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:17,246 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:17,640 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-29 00:10:17,918 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:17,923 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:17,925 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:17,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:17,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:17,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:17,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:17,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:17,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:17,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:17,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:17,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:17,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:17,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:17,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:17,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:17,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:17,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:17,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:17,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:17,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:17,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:17,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:17,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:17,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:17,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:17,945 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:17,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:17,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:17,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:17,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:17,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:17,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:17,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:17,949 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:17,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:17,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:17,954 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:17,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:17,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:18,001 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:18,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:18,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:18,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:18,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:18,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:18,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:18,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:18,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:18,013 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:18,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:18,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:18,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:18,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:18,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:18,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:18,113 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:18,220 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:10:18,220 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:10:18,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:18,228 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:18,228 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:18,231 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2018-11-29 00:10:18,298 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:18,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:18,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:18,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:18,433 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:18,449 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:18,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2018-11-29 00:10:18,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 86 states and 130 transitions. Complement of second has 7 states. [2018-11-29 00:10:18,665 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:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-29 00:10:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-29 00:10:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:10:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-29 00:10:18,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:18,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2018-11-29 00:10:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:18,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2018-11-29 00:10:18,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:18,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-29 00:10:18,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2018-11-29 00:10:18,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:18,689 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-29 00:10:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2018-11-29 00:10:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:10:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:10:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-11-29 00:10:18,717 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-29 00:10:18,717 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-29 00:10:18,717 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:18,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-11-29 00:10:18,718 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:18,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:18,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:18,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:18,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:18,720 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#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~2, 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; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 170#L18-3 [2018-11-29 00:10:18,720 INFO L796 eck$LassoCheckResult]: Loop: 170#L18-3 assume !!(rangesum_~i~1 < ~N~0); 172#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 181#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 170#L18-3 [2018-11-29 00:10:18,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2018-11-29 00:10:18,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:18,782 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:18,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:18,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:18,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:18,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2018-11-29 00:10:18,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:18,836 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:18,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:18,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:18,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:18,837 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:10:18,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:18,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:18,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:18,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-29 00:10:18,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:18,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:18,839 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:18,847 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:19,033 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-11-29 00:10:19,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:19,073 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:19,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:10:19,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:10:19,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:10:19,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:19,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:10:19,129 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:19,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:10:19,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:10:19,451 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:10:19,453 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:19,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:19,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:19,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:19,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:19,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:19,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:19,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:19,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-29 00:10:19,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:19,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:19,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:19,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:19,711 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-11-29 00:10:19,732 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:19,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:19,733 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:19,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:19,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:19,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:19,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:19,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:19,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:19,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:19,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:19,739 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:19,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:19,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:19,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:19,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:19,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:19,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:19,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:19,748 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:19,752 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:19,752 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:19,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:19,753 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:19,753 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:19,753 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2018-11-29 00:10:19,754 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:10:19,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:19,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:19,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:20,233 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:20,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:10:20,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-29 00:10:20,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2018-11-29 00:10:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:10:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-29 00:10:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:10:20,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-29 00:10:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:20,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-29 00:10:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:20,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2018-11-29 00:10:20,300 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:20,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2018-11-29 00:10:20,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-29 00:10:20,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-29 00:10:20,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2018-11-29 00:10:20,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:20,305 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-29 00:10:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2018-11-29 00:10:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-29 00:10:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-29 00:10:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-11-29 00:10:20,310 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-29 00:10:20,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:20,314 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2018-11-29 00:10:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:20,389 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2018-11-29 00:10:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:20,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2018-11-29 00:10:20,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:20,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2018-11-29 00:10:20,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-29 00:10:20,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-29 00:10:20,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2018-11-29 00:10:20,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:20,394 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-29 00:10:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2018-11-29 00:10:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-29 00:10:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-29 00:10:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-11-29 00:10:20,397 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-29 00:10:20,397 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-29 00:10:20,397 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:20,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2018-11-29 00:10:20,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:20,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:20,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:20,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:20,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:20,399 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 359#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~2, 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; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2018-11-29 00:10:20,400 INFO L796 eck$LassoCheckResult]: Loop: 339#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 351#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 337#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2018-11-29 00:10:20,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2018-11-29 00:10:20,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:20,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:20,474 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:20,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:20,475 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:20,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:20,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:20,574 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:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-29 00:10:20,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:20,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2018-11-29 00:10:20,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:20,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:20,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,790 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:10:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:20,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:20,852 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2018-11-29 00:10:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:21,001 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-11-29 00:10:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:21,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-11-29 00:10:21,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:21,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2018-11-29 00:10:21,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-29 00:10:21,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-29 00:10:21,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2018-11-29 00:10:21,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:21,006 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2018-11-29 00:10:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2018-11-29 00:10:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-29 00:10:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:10:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-29 00:10:21,009 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-29 00:10:21,009 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-29 00:10:21,009 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:21,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-29 00:10:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:21,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:21,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:21,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:21,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:21,011 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 450#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~2, 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; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2018-11-29 00:10:21,011 INFO L796 eck$LassoCheckResult]: Loop: 430#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 442#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 428#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2018-11-29 00:10:21,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2018-11-29 00:10:21,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2018-11-29 00:10:21,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:21,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2018-11-29 00:10:21,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:10:21,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:21,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:21,257 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:10:21,474 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:10:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:10:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:10:21,476 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-29 00:10:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:21,644 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-29 00:10:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:21,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-29 00:10:21,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:21,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2018-11-29 00:10:21,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-29 00:10:21,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-29 00:10:21,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-11-29 00:10:21,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:21,650 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-29 00:10:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-11-29 00:10:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-29 00:10:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-29 00:10:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-29 00:10:21,654 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-29 00:10:21,654 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-29 00:10:21,654 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:21,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2018-11-29 00:10:21,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:21,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:21,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:21,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:21,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:21,656 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 531#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~2, 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; 532#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 538#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 516#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 517#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 540#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 541#L7-3 assume !(init_nondet_~i~0 < ~N~0); 518#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 508#L18-3 assume !!(rangesum_~i~1 < ~N~0); 509#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 529#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 542#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2018-11-29 00:10:21,658 INFO L796 eck$LassoCheckResult]: Loop: 528#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 521#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 522#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2018-11-29 00:10:21,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2018-11-29 00:10:21,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2018-11-29 00:10:21,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:21,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2018-11-29 00:10:21,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:21,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:10:21,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:21,962 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:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:22,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:22,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:22,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-11-29 00:10:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-29 00:10:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-29 00:10:22,226 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-29 00:10:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:22,903 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2018-11-29 00:10:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-29 00:10:22,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-11-29 00:10:22,905 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-29 00:10:22,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 85 transitions. [2018-11-29 00:10:22,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-29 00:10:22,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-29 00:10:22,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2018-11-29 00:10:22,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:22,907 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-11-29 00:10:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2018-11-29 00:10:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-29 00:10:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:10:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-29 00:10:22,914 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-29 00:10:22,914 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-29 00:10:22,914 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:22,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2018-11-29 00:10:22,915 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:22,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:22,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:22,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-29 00:10:22,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:22,919 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 728#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~2, 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; 729#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 736#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 712#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 713#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 740#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 766#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 765#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 764#L7-3 assume !(init_nondet_~i~0 < ~N~0); 763#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 761#L18-3 assume !!(rangesum_~i~1 < ~N~0); 725#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 717#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 718#L18-3 assume !!(rangesum_~i~1 < ~N~0); 754#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 751#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 749#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2018-11-29 00:10:22,919 INFO L796 eck$LassoCheckResult]: Loop: 750#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 760#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 759#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2018-11-29 00:10:22,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 2 times [2018-11-29 00:10:22,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:22,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2018-11-29 00:10:22,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:22,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 2 times [2018-11-29 00:10:22,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-29 00:10:23,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:23,224 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:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:23,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:23,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:23,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:23,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:23,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-11-29 00:10:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-29 00:10:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-29 00:10:23,501 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 19 states. [2018-11-29 00:10:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:24,466 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-29 00:10:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:10:24,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2018-11-29 00:10:24,470 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2018-11-29 00:10:24,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2018-11-29 00:10:24,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-29 00:10:24,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-29 00:10:24,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2018-11-29 00:10:24,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:24,472 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2018-11-29 00:10:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2018-11-29 00:10:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-11-29 00:10:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-29 00:10:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-11-29 00:10:24,481 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-11-29 00:10:24,481 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-11-29 00:10:24,481 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:24,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2018-11-29 00:10:24,484 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:24,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:24,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:24,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-29 00:10:24,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:24,486 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1019#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~2, 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; 1020#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1027#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1004#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1005#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1030#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1061#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1060#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1058#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1057#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1056#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1055#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1054#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1017#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1010#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1011#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1050#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1048#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1045#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2018-11-29 00:10:24,486 INFO L796 eck$LassoCheckResult]: Loop: 1046#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1049#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1047#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2018-11-29 00:10:24,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2018-11-29 00:10:24,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2018-11-29 00:10:24,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2018-11-29 00:10:24,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-29 00:10:24,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:24,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:24,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-29 00:10:24,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:24,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-29 00:10:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:24,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-29 00:10:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:10:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:10:25,027 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 17 states. [2018-11-29 00:10:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:26,682 INFO L93 Difference]: Finished difference Result 245 states and 301 transitions. [2018-11-29 00:10:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-29 00:10:26,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 301 transitions. [2018-11-29 00:10:26,686 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 41 [2018-11-29 00:10:26,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 231 states and 286 transitions. [2018-11-29 00:10:26,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2018-11-29 00:10:26,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2018-11-29 00:10:26,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 286 transitions. [2018-11-29 00:10:26,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:26,692 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-11-29 00:10:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 286 transitions. [2018-11-29 00:10:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 133. [2018-11-29 00:10:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-29 00:10:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-11-29 00:10:26,704 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-29 00:10:26,704 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-29 00:10:26,705 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:26,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 163 transitions. [2018-11-29 00:10:26,706 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2018-11-29 00:10:26,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:26,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:26,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-11-29 00:10:26,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:26,710 INFO L794 eck$LassoCheckResult]: Stem: 1502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1498#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~2, 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; 1499#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1505#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1506#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1507#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1484#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1485#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1509#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1533#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1532#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1531#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1530#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1529#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1528#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1527#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1526#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1525#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1524#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1523#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1522#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1521#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1520#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1516#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1519#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2018-11-29 00:10:26,710 INFO L796 eck$LassoCheckResult]: Loop: 1573#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1574#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1571#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2018-11-29 00:10:26,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2018-11-29 00:10:26,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:26,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:26,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:26,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2018-11-29 00:10:26,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:26,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2018-11-29 00:10:26,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:26,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:26,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:26,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:27,013 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:10:27,750 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-11-29 00:10:27,851 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:27,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:27,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:27,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:27,852 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:27,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:27,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:27,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:27,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-29 00:10:27,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:27,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:27,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:27,891 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:28,082 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-11-29 00:10:28,144 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:28,148 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:28,149 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:28,150 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:28,152 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:28,154 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:28,155 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:28,156 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:28,157 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:28,159 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:28,160 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:28,161 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:28,163 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:28,165 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:28,166 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:28,167 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:28,170 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:28,172 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:28,174 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:28,175 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:28,177 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:28,178 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:28,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:28,639 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:28,640 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:28,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:28,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:28,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:28,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:28,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:28,645 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:28,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:28,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:28,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:28,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:28,655 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:28,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,656 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:28,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,661 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:28,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:28,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:28,671 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:28,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:28,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:28,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:28,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:28,681 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:28,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:28,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:28,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:28,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:28,689 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:28,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:28,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:28,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:28,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:28,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:28,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:28,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:28,778 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:10:28,778 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:10:28,778 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:28,781 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:28,781 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:28,781 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2018-11-29 00:10:28,908 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-29 00:10:28,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:28,987 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,988 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:28,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41 Second operand 4 states. [2018-11-29 00:10:29,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41. Second operand 4 states. Result 170 states and 212 transitions. Complement of second has 7 states. [2018-11-29 00:10:29,027 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:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:10:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-29 00:10:29,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-29 00:10:29,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:29,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-29 00:10:29,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:29,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-29 00:10:29,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:29,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 212 transitions. [2018-11-29 00:10:29,031 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-29 00:10:29,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 144 states and 176 transitions. [2018-11-29 00:10:29,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-29 00:10:29,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-11-29 00:10:29,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 176 transitions. [2018-11-29 00:10:29,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:29,034 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 176 transitions. [2018-11-29 00:10:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 176 transitions. [2018-11-29 00:10:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-11-29 00:10:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-29 00:10:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-29 00:10:29,043 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-29 00:10:29,043 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-29 00:10:29,043 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:10:29,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 168 transitions. [2018-11-29 00:10:29,046 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-29 00:10:29,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:29,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:29,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:29,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:29,048 INFO L794 eck$LassoCheckResult]: Stem: 1936#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1932#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~2, 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; 1933#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1940#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1944#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1982#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1981#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1979#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1978#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1977#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1976#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1975#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1974#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1973#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1972#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1970#L18-3 assume !(rangesum_~i~1 < ~N~0); 1968#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1966#L27 main_#t~ret5 := rangesum_#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);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1964#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1962#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1960#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1958#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1956#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1955#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1950#L18-8 assume !(rangesum_~i~1 < ~N~0); 1949#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1948#L27-1 main_#t~ret8 := rangesum_#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~2 := 0; 1938#L46-3 [2018-11-29 00:10:29,048 INFO L796 eck$LassoCheckResult]: Loop: 1938#L46-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 1939#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 1938#L46-3 [2018-11-29 00:10:29,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2018-11-29 00:10:29,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2018-11-29 00:10:29,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2018-11-29 00:10:29,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,519 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:29,677 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-29 00:10:30,482 WARN L180 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 150 [2018-11-29 00:10:30,944 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-29 00:10:30,947 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:30,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:30,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:30,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:30,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:30,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:30,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:30,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:30,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-29 00:10:30,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:30,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:30,952 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:30,983 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:31,008 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:31,031 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:31,043 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:31,047 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:31,319 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-29 00:10:31,328 INFO L168 Benchmark]: Toolchain (without parser) took 16700.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 948.7 MB in the beginning and 862.4 MB in the end (delta: 86.2 MB). Peak memory consumption was 382.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:31,332 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:31,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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:31,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.42 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 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:31,336 INFO L168 Benchmark]: Boogie Preprocessor took 147.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:31,337 INFO L168 Benchmark]: RCFGBuilder took 639.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:31,343 INFO L168 Benchmark]: BuchiAutomizer took 15457.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 862.4 MB in the end (delta: 221.0 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:31,349 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 358.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 85.42 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 147.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 639.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15457.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 862.4 MB in the end (delta: 221.0 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...