./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/rangesum05_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 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-14 04:54:51,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:54:51,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:54:51,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:54:51,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:54:51,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:54:51,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:54:51,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:54:51,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:54:51,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:54:51,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:54:51,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:54:51,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:54:51,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:54:51,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:54:51,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:54:51,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:54:51,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:54:51,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:54:51,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:54:51,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:54:51,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:54:51,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:54:51,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:54:51,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:54:51,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:54:51,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:54:51,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:54:51,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:54:51,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:54:51,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:54:51,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:54:51,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:54:51,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:54:51,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:54:51,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:54:51,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:54:51,808 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:54:51,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:54:51,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:54:51,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:54:51,810 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:54:51,810 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:54:51,810 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:54:51,811 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:54:51,812 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:54:51,812 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:54:51,812 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:54:51,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:54:51,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:54:51,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:54:51,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:54:51,815 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:54:51,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:54:51,815 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:54:51,815 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:54:51,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:54:51,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:54:51,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:54:51,816 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:54:51,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:54:51,816 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:54:51,817 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:54:51,818 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:54:51,818 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 -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2019-01-14 04:54:51,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:54:51,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:54:51,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:54:51,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:54:51,872 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:54:51,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-14 04:54:51,924 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e028a0e/bdc3ed144e44449fb3bec5d74527b961/FLAG71342fa3c [2019-01-14 04:54:52,376 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:54:52,379 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-14 04:54:52,389 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e028a0e/bdc3ed144e44449fb3bec5d74527b961/FLAG71342fa3c [2019-01-14 04:54:52,713 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e028a0e/bdc3ed144e44449fb3bec5d74527b961 [2019-01-14 04:54:52,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:54:52,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:54:52,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:52,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:54:52,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:54:52,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1993ede3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52, skipping insertion in model container [2019-01-14 04:54:52,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:54:52,752 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:54:52,995 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:53,011 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:54:53,051 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:53,079 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:54:53,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53 WrapperNode [2019-01-14 04:54:53,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:53,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:53,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:54:53,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:54:53,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:53,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:54:53,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:54:53,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:54:53,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... [2019-01-14 04:54:53,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:54:53,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:54:53,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:54:53,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:54:53,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:54:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:54:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:54:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:54:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:54:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:54:53,914 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:54:53,914 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-14 04:54:53,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:53 BoogieIcfgContainer [2019-01-14 04:54:53,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:54:53,916 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:54:53,916 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:54:53,920 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:54:53,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:54:52" (1/3) ... [2019-01-14 04:54:53,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44de51d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:53, skipping insertion in model container [2019-01-14 04:54:53,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:53" (2/3) ... [2019-01-14 04:54:53,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44de51d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:53, skipping insertion in model container [2019-01-14 04:54:53,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:53" (3/3) ... [2019-01-14 04:54:53,925 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2019-01-14 04:54:53,977 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:54:53,978 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:54:53,978 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:54:53,978 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:54:53,978 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:54:53,978 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:54:53,978 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:54:53,979 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:54:53,979 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:54:53,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-14 04:54:54,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-14 04:54:54,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:54,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:54,020 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:54:54,020 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:54,020 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:54:54,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-14 04:54:54,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-14 04:54:54,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:54,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:54,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:54:54,024 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:54,029 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 26#L6-3true [2019-01-14 04:54:54,030 INFO L796 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 5);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; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2019-01-14 04:54:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 04:54:54,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 04:54:54,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:54,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 04:54:54,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,547 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:54:54,614 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:54,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:54,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:54,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:54,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:54,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:54,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:54,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:54,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 04:54:54,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:54,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:54,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,911 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-14 04:54:55,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,436 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:54:55,738 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:55,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:55,744 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 [2019-01-14 04:54:55,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:55,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:55,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:55,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,754 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 [2019-01-14 04:54:55,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:55,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:55,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:55,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,758 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 [2019-01-14 04:54:55,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:55,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:55,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:55,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,761 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 [2019-01-14 04:54:55,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:55,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:55,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,771 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 [2019-01-14 04:54:55,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:55,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:55,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:55,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,775 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 [2019-01-14 04:54:55,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,776 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:54:55,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,780 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:54:55,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:55,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:55,810 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 [2019-01-14 04:54:55,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:55,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:55,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:55,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:55,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:55,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:55,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:55,966 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 04:54:55,969 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 04:54:55,971 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:55,976 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:55,976 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:55,977 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_init_nondet_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0 Supporting invariants [] [2019-01-14 04:54:56,022 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:54:56,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:54:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:56,227 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:54:56,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-01-14 04:54:56,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 119 transitions. Complement of second has 8 states. [2019-01-14 04:54:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:54:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-14 04:54:56,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 04:54:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 04:54:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:54:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2019-01-14 04:54:56,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:56,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2019-01-14 04:54:56,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:54:56,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:56,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-01-14 04:54:56,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:56,478 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-14 04:54:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-01-14 04:54:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 04:54:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:54:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-01-14 04:54:56,502 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-14 04:54:56,502 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-14 04:54:56,502 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:54:56,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-01-14 04:54:56,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:56,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:56,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:56,504 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:54:56,504 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:56,504 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 175#L6-3 assume !(init_nondet_~i~0 < 5); 178#L4 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; 161#L17-3 [2019-01-14 04:54:56,505 INFO L796 eck$LassoCheckResult]: Loop: 161#L17-3 assume !!(rangesum_~i~1 < 5); 169#L18 assume rangesum_~i~1 > 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; 160#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 161#L17-3 [2019-01-14 04:54:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-14 04:54:56,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:56,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:56,572 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-01-14 04:54:56,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:56,699 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-14 04:54:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:56,715 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-01-14 04:54:56,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:56,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,720 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:56,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-01-14 04:54:56,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:54:56,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:56,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:56,722 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 04:54:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 04:54:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:54:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-14 04:54:56,725 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 04:54:56,725 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 04:54:56,725 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:54:56,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-14 04:54:56,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:56,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:56,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:56,727 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:54:56,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:56,727 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 226#L6-3 assume !!(init_nondet_~i~0 < 5);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; 229#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 230#L6-3 assume !(init_nondet_~i~0 < 5); 231#L4 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; 212#L17-3 [2019-01-14 04:54:56,728 INFO L796 eck$LassoCheckResult]: Loop: 212#L17-3 assume !!(rangesum_~i~1 < 5); 220#L18 assume rangesum_~i~1 > 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; 211#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 212#L17-3 [2019-01-14 04:54:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-14 04:54:56,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:56,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:56,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:56,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:56,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:56,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:54:56,886 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-01-14 04:54:56,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:54:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:54:57,008 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-14 04:54:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:57,058 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-01-14 04:54:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:57,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-14 04:54:57,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-01-14 04:54:57,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:54:57,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:57,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-14 04:54:57,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:57,062 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 04:54:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-14 04:54:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 04:54:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:54:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 04:54:57,065 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:54:57,065 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:54:57,065 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:54:57,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 04:54:57,066 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:57,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:57,067 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 04:54:57,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:57,068 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 296#L6-3 assume !!(init_nondet_~i~0 < 5);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; 299#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 300#L6-3 assume !!(init_nondet_~i~0 < 5);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; 301#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 304#L6-3 assume !(init_nondet_~i~0 < 5); 303#L4 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; 282#L17-3 [2019-01-14 04:54:57,068 INFO L796 eck$LassoCheckResult]: Loop: 282#L17-3 assume !!(rangesum_~i~1 < 5); 290#L18 assume rangesum_~i~1 > 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; 281#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 282#L17-3 [2019-01-14 04:54:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-14 04:54:57,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:57,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:57,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:57,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:57,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:57,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:57,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:54:57,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-01-14 04:54:57,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:54:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:54:57,459 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-14 04:54:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:57,495 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-14 04:54:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:57,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-14 04:54:57,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-01-14 04:54:57,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:54:57,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:57,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-14 04:54:57,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:57,500 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-14 04:54:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-14 04:54:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 04:54:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 04:54:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-14 04:54:57,503 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 04:54:57,503 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 04:54:57,503 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:54:57,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-14 04:54:57,504 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:57,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:57,505 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-14 04:54:57,505 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:57,505 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 377#L6-3 assume !!(init_nondet_~i~0 < 5);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; 380#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 384#L6-3 assume !!(init_nondet_~i~0 < 5);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; 387#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 5);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; 382#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 386#L6-3 assume !(init_nondet_~i~0 < 5); 385#L4 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; 363#L17-3 [2019-01-14 04:54:57,505 INFO L796 eck$LassoCheckResult]: Loop: 363#L17-3 assume !!(rangesum_~i~1 < 5); 371#L18 assume rangesum_~i~1 > 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; 362#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 363#L17-3 [2019-01-14 04:54:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-14 04:54:57,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:57,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:54:57,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 04:54:57,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:57,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:57,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 04:54:57,651 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-01-14 04:54:57,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,830 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:54:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:54:57,853 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-14 04:54:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:57,888 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-14 04:54:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:54:57,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-14 04:54:57,890 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-01-14 04:54:57,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:54:57,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:57,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-14 04:54:57,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:57,894 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 04:54:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-14 04:54:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 04:54:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 04:54:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-14 04:54:57,897 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 04:54:57,897 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 04:54:57,897 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:54:57,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-14 04:54:57,898 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:57,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:57,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:57,900 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-14 04:54:57,900 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:57,901 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 468#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 469#L6-3 assume !!(init_nondet_~i~0 < 5);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; 472#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 5);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; 474#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 476#L6-3 assume !!(init_nondet_~i~0 < 5);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; 481#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 480#L6-3 assume !!(init_nondet_~i~0 < 5);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; 479#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 478#L6-3 assume !(init_nondet_~i~0 < 5); 477#L4 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; 455#L17-3 [2019-01-14 04:54:57,901 INFO L796 eck$LassoCheckResult]: Loop: 455#L17-3 assume !!(rangesum_~i~1 < 5); 463#L18 assume rangesum_~i~1 > 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; 454#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 455#L17-3 [2019-01-14 04:54:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-14 04:54:57,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:58,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:58,162 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 [2019-01-14 04:54:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:54:58,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:54:58,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:58,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:58,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:58,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 04:54:58,220 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-01-14 04:54:58,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:54:58,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:54:58,282 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-01-14 04:54:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:58,333 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-14 04:54:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:54:58,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-14 04:54:58,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:58,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2019-01-14 04:54:58,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:54:58,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:58,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-14 04:54:58,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:58,337 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 04:54:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-14 04:54:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 04:54:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 04:54:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-14 04:54:58,341 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 04:54:58,341 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 04:54:58,341 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:54:58,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-14 04:54:58,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:58,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:58,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:58,342 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-14 04:54:58,342 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:58,343 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 570#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 571#L6-3 assume !!(init_nondet_~i~0 < 5);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; 574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 575#L6-3 assume !!(init_nondet_~i~0 < 5);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; 576#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 585#L6-3 assume !!(init_nondet_~i~0 < 5);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; 584#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L6-3 assume !!(init_nondet_~i~0 < 5);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; 582#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 581#L6-3 assume !!(init_nondet_~i~0 < 5);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; 580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 579#L6-3 assume !(init_nondet_~i~0 < 5); 578#L4 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; 557#L17-3 [2019-01-14 04:54:58,343 INFO L796 eck$LassoCheckResult]: Loop: 557#L17-3 assume !!(rangesum_~i~1 < 5); 565#L18 assume rangesum_~i~1 > 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; 556#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 557#L17-3 [2019-01-14 04:54:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-14 04:54:58,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-01-14 04:54:58,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-01-14 04:54:58,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:58,502 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 04:54:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:58,569 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-01-14 04:54:58,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:58,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-01-14 04:54:58,572 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:58,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-01-14 04:54:58,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 04:54:58,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 04:54:58,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-01-14 04:54:58,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:58,574 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-01-14 04:54:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-01-14 04:54:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 04:54:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 04:54:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-01-14 04:54:58,577 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-14 04:54:58,577 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-14 04:54:58,577 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:54:58,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-01-14 04:54:58,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:58,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:58,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:58,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:58,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:58,579 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 648#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 649#L6-3 assume !!(init_nondet_~i~0 < 5);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; 653#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 654#L6-3 assume !!(init_nondet_~i~0 < 5);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; 655#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 658#L6-3 assume !!(init_nondet_~i~0 < 5);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; 667#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 665#L6-3 assume !!(init_nondet_~i~0 < 5);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; 664#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 663#L6-3 assume !!(init_nondet_~i~0 < 5);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; 661#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 660#L6-3 assume !(init_nondet_~i~0 < 5); 659#L4 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; 656#L17-3 assume !!(rangesum_~i~1 < 5); 643#L18 assume !(rangesum_~i~1 > 2); 633#L17-2 [2019-01-14 04:54:58,579 INFO L796 eck$LassoCheckResult]: Loop: 633#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 634#L17-3 assume !!(rangesum_~i~1 < 5); 666#L18 assume rangesum_~i~1 > 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; 633#L17-2 [2019-01-14 04:54:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2019-01-14 04:54:58,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2019-01-14 04:54:58,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2019-01-14 04:54:58,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:58,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:58,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:58,696 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 [2019-01-14 04:54:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:58,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:58,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-14 04:54:59,137 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:54:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:54:59,157 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-14 04:54:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:59,222 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-14 04:54:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:59,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2019-01-14 04:54:59,225 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:59,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2019-01-14 04:54:59,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 04:54:59,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 04:54:59,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-01-14 04:54:59,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:59,228 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-01-14 04:54:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-01-14 04:54:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-14 04:54:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 04:54:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-14 04:54:59,233 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 04:54:59,233 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 04:54:59,233 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:54:59,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-01-14 04:54:59,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:59,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:59,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:59,236 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 04:54:59,236 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:59,237 INFO L794 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 798#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 799#L6-3 assume !!(init_nondet_~i~0 < 5);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; 803#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 804#L6-3 assume !!(init_nondet_~i~0 < 5);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; 805#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 808#L6-3 assume !!(init_nondet_~i~0 < 5);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; 821#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 820#L6-3 assume !!(init_nondet_~i~0 < 5);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; 816#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 815#L6-3 assume !!(init_nondet_~i~0 < 5);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; 814#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 813#L6-3 assume !(init_nondet_~i~0 < 5); 809#L4 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; 810#L17-3 assume !!(rangesum_~i~1 < 5); 822#L18 assume !(rangesum_~i~1 > 2); 781#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 782#L17-3 assume !!(rangesum_~i~1 < 5); 791#L18 assume !(rangesum_~i~1 > 2); 792#L17-2 [2019-01-14 04:54:59,237 INFO L796 eck$LassoCheckResult]: Loop: 792#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 818#L17-3 assume !!(rangesum_~i~1 < 5); 819#L18 assume rangesum_~i~1 > 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; 792#L17-2 [2019-01-14 04:54:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2019-01-14 04:54:59,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2019-01-14 04:54:59,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2019-01-14 04:54:59,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:59,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:59,363 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 [2019-01-14 04:54:59,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:59,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:59,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:59,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:59,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:54:59,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:54:59,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:54:59,577 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-14 04:54:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:59,679 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-01-14 04:54:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:59,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-01-14 04:54:59,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:59,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2019-01-14 04:54:59,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-14 04:54:59,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-14 04:54:59,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2019-01-14 04:54:59,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:59,684 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-01-14 04:54:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2019-01-14 04:54:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-01-14 04:54:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 04:54:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-01-14 04:54:59,689 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-14 04:54:59,689 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-14 04:54:59,689 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:54:59,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-01-14 04:54:59,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-14 04:54:59,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:59,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:59,691 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2019-01-14 04:54:59,691 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:54:59,691 INFO L794 eck$LassoCheckResult]: Stem: 975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 972#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 973#L6-3 assume !!(init_nondet_~i~0 < 5);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; 977#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 978#L6-3 assume !!(init_nondet_~i~0 < 5);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; 979#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 998#L6-3 assume !!(init_nondet_~i~0 < 5);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; 996#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 993#L6-3 assume !!(init_nondet_~i~0 < 5);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; 992#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 990#L6-3 assume !!(init_nondet_~i~0 < 5);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; 987#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 986#L6-3 assume !(init_nondet_~i~0 < 5); 983#L4 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; 984#L17-3 assume !!(rangesum_~i~1 < 5); 967#L18 assume !(rangesum_~i~1 > 2); 957#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 958#L17-3 assume !!(rangesum_~i~1 < 5); 980#L18 assume !(rangesum_~i~1 > 2); 1001#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1000#L17-3 assume !!(rangesum_~i~1 < 5); 999#L18 assume !(rangesum_~i~1 > 2); 997#L17-2 [2019-01-14 04:54:59,691 INFO L796 eck$LassoCheckResult]: Loop: 997#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 994#L17-3 assume !!(rangesum_~i~1 < 5); 995#L18 assume rangesum_~i~1 > 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; 997#L17-2 [2019-01-14 04:54:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2019-01-14 04:54:59,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2019-01-14 04:54:59,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:59,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2019-01-14 04:54:59,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:59,914 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:00,719 WARN L181 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 119 [2019-01-14 04:55:00,813 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:00,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:00,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:00,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:00,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:00,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:00,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:00,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:00,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-14 04:55:00,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:00,815 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:00,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,005 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-14 04:55:01,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:01,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:01,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:55:01,518 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 [2019-01-14 04:55:01,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:01,519 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:55:01,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:01,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:01,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:55:01,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:01,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:01,540 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 [2019-01-14 04:55:01,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:01,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:01,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:01,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:01,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:01,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:01,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:01,555 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 [2019-01-14 04:55:01,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:01,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:01,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:01,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:01,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:01,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:01,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:01,566 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 [2019-01-14 04:55:01,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:01,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:01,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:01,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:01,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:01,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:01,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:01,575 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 [2019-01-14 04:55:01,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:01,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:01,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:01,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:01,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:01,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:01,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:55:01,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:55:01,641 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:55:01,641 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:55:01,642 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:55:01,643 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:55:01,644 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 7 Supporting invariants [] [2019-01-14 04:55:01,771 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 04:55:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:02,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:02,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:55:02,137 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 [2019-01-14 04:55:02,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 04:55:02,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 7 states. [2019-01-14 04:55:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:55:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:55:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 04:55:02,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 04:55:02,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:02,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-14 04:55:02,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:02,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-14 04:55:02,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:02,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-01-14 04:55:02,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-14 04:55:02,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2019-01-14 04:55:02,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 04:55:02,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 04:55:02,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-14 04:55:02,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:55:02,193 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 04:55:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-14 04:55:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-14 04:55:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 04:55:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-01-14 04:55:02,198 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 04:55:02,198 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 04:55:02,199 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:55:02,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-01-14 04:55:02,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-14 04:55:02,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:02,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:02,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:02,201 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:55:02,201 INFO L794 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1211#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 1212#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1216#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1217#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1218#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1240#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1239#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1238#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1237#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1236#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1235#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1234#L6-3 assume !(init_nondet_~i~0 < 5); 1221#L4 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; 1219#L17-3 assume !!(rangesum_~i~1 < 5); 1204#L18 assume !(rangesum_~i~1 > 2); 1192#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1193#L17-3 assume !!(rangesum_~i~1 < 5); 1205#L18 assume !(rangesum_~i~1 > 2); 1206#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1231#L17-3 assume !!(rangesum_~i~1 < 5); 1229#L18 assume !(rangesum_~i~1 > 2); 1226#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1224#L17-3 assume !(rangesum_~i~1 < 5); 1215#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1196#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;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; 1197#L17-8 assume !!(rangesum_~i~1 < 5); 1200#L18-2 assume !(rangesum_~i~1 > 2); 1201#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1213#L17-8 assume !!(rangesum_~i~1 < 5); 1233#L18-2 assume !(rangesum_~i~1 > 2); 1232#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1230#L17-8 assume !!(rangesum_~i~1 < 5); 1227#L18-2 assume !(rangesum_~i~1 > 2); 1225#L17-7 [2019-01-14 04:55:02,201 INFO L796 eck$LassoCheckResult]: Loop: 1225#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1222#L17-8 assume !!(rangesum_~i~1 < 5); 1223#L18-2 assume rangesum_~i~1 > 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; 1225#L17-7 [2019-01-14 04:55:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2019-01-14 04:55:02,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:02,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 04:55:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:55:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:55:02,298 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-01-14 04:55:02,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:02,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:02,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:55:02,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:55:02,425 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-14 04:55:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:02,480 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-01-14 04:55:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:55:02,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-01-14 04:55:02,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-01-14 04:55:02,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2019-01-14 04:55:02,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-14 04:55:02,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-14 04:55:02,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2019-01-14 04:55:02,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:55:02,485 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-01-14 04:55:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2019-01-14 04:55:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-01-14 04:55:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 04:55:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-01-14 04:55:02,491 INFO L729 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 04:55:02,491 INFO L609 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 04:55:02,492 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:55:02,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2019-01-14 04:55:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:55:02,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:02,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:02,496 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:02,496 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:55:02,496 INFO L794 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1345#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 1346#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1350#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1351#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1352#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1358#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1371#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1370#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1369#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1368#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !(init_nondet_~i~0 < 5); 1359#L4 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; 1353#L17-3 assume !!(rangesum_~i~1 < 5); 1338#L18 assume !(rangesum_~i~1 > 2); 1326#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1327#L17-3 assume !!(rangesum_~i~1 < 5); 1376#L18 assume !(rangesum_~i~1 > 2); 1377#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1378#L17-3 assume !!(rangesum_~i~1 < 5); 1339#L18 assume !(rangesum_~i~1 > 2); 1328#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1329#L17-3 assume !!(rangesum_~i~1 < 5); 1354#L18 assume rangesum_~i~1 > 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; 1364#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1362#L17-3 assume !(rangesum_~i~1 < 5); 1349#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1330#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;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; 1331#L17-8 assume !!(rangesum_~i~1 < 5); 1375#L18-2 assume !(rangesum_~i~1 > 2); 1347#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1344#L17-8 assume !!(rangesum_~i~1 < 5); 1334#L18-2 assume !(rangesum_~i~1 > 2); 1335#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1374#L17-8 assume !!(rangesum_~i~1 < 5); 1373#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-01-14 04:55:02,497 INFO L796 eck$LassoCheckResult]: Loop: 1367#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1372#L17-8 assume !!(rangesum_~i~1 < 5); 1361#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-01-14 04:55:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2019-01-14 04:55:02,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:02,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 04:55:02,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:55:02,571 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 [2019-01-14 04:55:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:02,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-14 04:55:02,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 04:55:02,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 04:55:02,658 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-01-14 04:55:02,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:02,718 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:02,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:02,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:02,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:02,719 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:55:02,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:02,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:02,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:02,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2019-01-14 04:55:02,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:02,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:02,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:02,853 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:02,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:55:02,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:55:02,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:55:02,873 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:02,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:55:02,903 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:02,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:55:02,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:55:03,031 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:55:03,034 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:03,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:03,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:03,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:03,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:03,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:03,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:03,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:03,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2019-01-14 04:55:03,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:03,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:03,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:03,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:03,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:03,090 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:55:03,092 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 [2019-01-14 04:55:03,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,095 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 [2019-01-14 04:55:03,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:55:03,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:55:03,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:55:03,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:55:03,100 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:55:03,100 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:55:03,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2019-01-14 04:55:03,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:55:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:03,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:03,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:55:03,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:55:03,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 04:55:03,374 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 71 states and 83 transitions. Complement of second has 5 states. [2019-01-14 04:55:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:55:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:55:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-01-14 04:55:03,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-14 04:55:03,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:03,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2019-01-14 04:55:03,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:03,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2019-01-14 04:55:03,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:03,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2019-01-14 04:55:03,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-14 04:55:03,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2019-01-14 04:55:03,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 04:55:03,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 04:55:03,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2019-01-14 04:55:03,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:55:03,381 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-01-14 04:55:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2019-01-14 04:55:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-14 04:55:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 04:55:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-01-14 04:55:03,391 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-01-14 04:55:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:55:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:55:03,392 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 7 states. [2019-01-14 04:55:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:04,140 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2019-01-14 04:55:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:55:04,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 107 transitions. [2019-01-14 04:55:04,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 04:55:04,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 104 transitions. [2019-01-14 04:55:04,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-14 04:55:04,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-14 04:55:04,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 104 transitions. [2019-01-14 04:55:04,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:55:04,145 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-01-14 04:55:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 104 transitions. [2019-01-14 04:55:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-01-14 04:55:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 04:55:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-01-14 04:55:04,149 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-14 04:55:04,149 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-14 04:55:04,149 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:55:04,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2019-01-14 04:55:04,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-14 04:55:04,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:04,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:04,151 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:04,151 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:55:04,151 INFO L794 eck$LassoCheckResult]: Stem: 1900#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1896#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 1897#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1902#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1903#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1904#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1929#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1928#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1927#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1925#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1924#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1921#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1920#L6-3 assume !(init_nondet_~i~0 < 5); 1909#L4 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; 1910#L17-3 assume !!(rangesum_~i~1 < 5); 1888#L18 assume !(rangesum_~i~1 > 2); 1874#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1875#L17-3 assume !!(rangesum_~i~1 < 5); 1889#L18 assume !(rangesum_~i~1 > 2); 1876#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1877#L17-3 assume !!(rangesum_~i~1 < 5); 1906#L18 assume !(rangesum_~i~1 > 2); 1916#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1933#L17-3 assume !!(rangesum_~i~1 < 5); 1931#L18 assume rangesum_~i~1 > 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; 1915#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1917#L17-3 assume !!(rangesum_~i~1 < 5); 1914#L18 assume rangesum_~i~1 > 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; 1913#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1905#L17-3 assume !(rangesum_~i~1 < 5); 1901#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1878#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;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; 1879#L17-8 assume !!(rangesum_~i~1 < 5); 1882#L18-2 assume !(rangesum_~i~1 > 2); 1883#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1898#L17-8 assume !!(rangesum_~i~1 < 5); 1884#L18-2 assume !(rangesum_~i~1 > 2); 1885#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1934#L17-8 assume !!(rangesum_~i~1 < 5); 1932#L18-2 assume !(rangesum_~i~1 > 2); 1930#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1926#L17-8 assume !!(rangesum_~i~1 < 5); 1923#L18-2 assume rangesum_~i~1 > 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; 1922#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1919#L17-8 assume !!(rangesum_~i~1 < 5); 1912#L18-2 [2019-01-14 04:55:04,151 INFO L796 eck$LassoCheckResult]: Loop: 1912#L18-2 assume rangesum_~i~1 > 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; 1918#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1911#L17-8 assume !!(rangesum_~i~1 < 5); 1912#L18-2 [2019-01-14 04:55:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2019-01-14 04:55:04,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,160 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:55:04,160 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:55:04,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:55:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-01-14 04:55:04,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2019-01-14 04:55:04,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,312 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:55:04,312 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:55:04,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:55:04,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:55:04,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:55:04,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:55:04,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-14 04:55:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:55:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:55:04,850 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:05,063 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:55:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:55:05,064 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 04:55:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:05,675 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-14 04:55:05,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:55:05,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2019-01-14 04:55:05,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 04:55:05,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2019-01-14 04:55:05,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 04:55:05,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-01-14 04:55:05,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2019-01-14 04:55:05,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:55:05,679 INFO L706 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-14 04:55:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2019-01-14 04:55:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-01-14 04:55:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 04:55:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-01-14 04:55:05,686 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-01-14 04:55:05,686 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-01-14 04:55:05,686 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:55:05,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2019-01-14 04:55:05,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 04:55:05,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:05,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:05,690 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:05,690 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:05,690 INFO L794 eck$LassoCheckResult]: Stem: 2194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2191#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);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; 2192#L6-3 assume !!(init_nondet_~i~0 < 5);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; 2196#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2197#L6-3 assume !!(init_nondet_~i~0 < 5);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; 2198#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2225#L6-3 assume !!(init_nondet_~i~0 < 5);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; 2224#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2223#L6-3 assume !!(init_nondet_~i~0 < 5);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; 2222#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2221#L6-3 assume !!(init_nondet_~i~0 < 5);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; 2220#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2219#L6-3 assume !(init_nondet_~i~0 < 5); 2201#L4 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; 2199#L17-3 assume !!(rangesum_~i~1 < 5); 2183#L18 assume !(rangesum_~i~1 > 2); 2170#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2171#L17-3 assume !!(rangesum_~i~1 < 5); 2184#L18 assume !(rangesum_~i~1 > 2); 2172#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2173#L17-3 assume !!(rangesum_~i~1 < 5); 2218#L18 assume !(rangesum_~i~1 > 2); 2215#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2217#L17-3 assume !!(rangesum_~i~1 < 5); 2214#L18 assume rangesum_~i~1 > 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; 2212#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2210#L17-3 assume !!(rangesum_~i~1 < 5); 2208#L18 assume rangesum_~i~1 > 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; 2206#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2204#L17-3 assume !(rangesum_~i~1 < 5); 2195#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2174#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;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; 2175#L17-8 assume !!(rangesum_~i~1 < 5); 2178#L18-2 assume !(rangesum_~i~1 > 2); 2179#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2193#L17-8 assume !!(rangesum_~i~1 < 5); 2180#L18-2 assume !(rangesum_~i~1 > 2); 2181#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2189#L17-8 assume !!(rangesum_~i~1 < 5); 2190#L18-2 assume !(rangesum_~i~1 > 2); 2216#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2213#L17-8 assume !!(rangesum_~i~1 < 5); 2211#L18-2 assume rangesum_~i~1 > 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; 2209#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2207#L17-8 assume !!(rangesum_~i~1 < 5); 2205#L18-2 assume rangesum_~i~1 > 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; 2203#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2202#L17-8 assume !(rangesum_~i~1 < 5); 2185#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2186#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 2187#L43-3 [2019-01-14 04:55:05,691 INFO L796 eck$LassoCheckResult]: Loop: 2187#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 2188#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 2187#L43-3 [2019-01-14 04:55:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2019-01-14 04:55:05,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:05,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:05,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:05,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,709 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:55:05,709 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:55:05,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:55:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-01-14 04:55:05,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2019-01-14 04:55:05,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,858 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:55:05,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:55:05,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:55:05,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:10,227 WARN L181 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 338 DAG size of output: 254 [2019-01-14 04:55:33,758 WARN L181 SmtUtils]: Spent 21.44 s on a formula simplification. DAG size of input: 307 DAG size of output: 152 [2019-01-14 04:55:33,762 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:33,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:33,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:33,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:33,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:33,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:33,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:33,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:33,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-14 04:55:33,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:33,763 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:33,766 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:55:33,811 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5735 disjunctions. This might take some time... [2019-01-14 04:55:34,014 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 137 disjunctions. [2019-01-14 04:55:34,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:34,428 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) [2019-01-14 04:55:34,430 INFO L168 Benchmark]: Toolchain (without parser) took 41714.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.6 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -381.2 MB). Peak memory consumption was 493.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,432 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:55:34,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.03 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,434 INFO L168 Benchmark]: Boogie Preprocessor took 114.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,434 INFO L168 Benchmark]: RCFGBuilder took 655.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,435 INFO L168 Benchmark]: BuchiAutomizer took 40513.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.7 MB). Peak memory consumption was 509.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:34,440 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.03 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 655.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40513.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.7 MB). Peak memory consumption was 509.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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...