./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 2e94e6aa 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-2e94e6a [2019-01-02 00:16:57,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:16:57,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:16:58,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:16:58,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:16:58,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:16:58,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:16:58,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:16:58,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:16:58,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:16:58,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:16:58,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:16:58,018 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:16:58,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:16:58,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:16:58,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:16:58,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:16:58,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:16:58,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:16:58,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:16:58,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:16:58,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:16:58,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:16:58,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:16:58,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:16:58,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:16:58,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:16:58,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:16:58,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:16:58,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:16:58,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:16:58,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:16:58,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:16:58,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:16:58,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:16:58,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:16:58,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:16:58,068 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:16:58,069 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:16:58,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:16:58,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:16:58,070 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:16:58,070 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:16:58,074 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:16:58,074 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:16:58,074 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:16:58,075 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:16:58,075 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:16:58,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:16:58,075 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:16:58,075 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:16:58,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:16:58,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:16:58,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:16:58,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:16:58,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:16:58,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:16:58,079 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:16:58,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:16:58,080 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:16:58,080 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:16:58,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:16:58,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:16:58,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:16:58,081 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:16:58,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:16:58,081 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:16:58,081 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:16:58,082 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:16:58,082 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-02 00:16:58,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:16:58,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:16:58,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:16:58,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:16:58,148 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:16:58,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-02 00:16:58,210 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7dbd272/9d0375ab736a48f3b85a009b97644c6b/FLAG935f7775f [2019-01-02 00:16:58,650 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:16:58,650 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2019-01-02 00:16:58,658 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7dbd272/9d0375ab736a48f3b85a009b97644c6b/FLAG935f7775f [2019-01-02 00:16:59,001 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7dbd272/9d0375ab736a48f3b85a009b97644c6b [2019-01-02 00:16:59,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:16:59,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:16:59,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:59,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:16:59,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:16:59,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa198c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59, skipping insertion in model container [2019-01-02 00:16:59,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:16:59,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:16:59,240 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:59,263 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:16:59,308 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:59,330 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:16:59,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59 WrapperNode [2019-01-02 00:16:59,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:59,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:59,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:16:59,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:16:59,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:59,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:16:59,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:16:59,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:16:59,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (1/1) ... [2019-01-02 00:16:59,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:16:59,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:16:59,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:16:59,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:16:59,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (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-02 00:16:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:16:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:16:59,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:16:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:16:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:16:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:17:00,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:17:00,235 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:17:00,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:00 BoogieIcfgContainer [2019-01-02 00:17:00,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:17:00,236 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:17:00,236 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:17:00,240 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:17:00,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:00,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:16:59" (1/3) ... [2019-01-02 00:17:00,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@792ca8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:00, skipping insertion in model container [2019-01-02 00:17:00,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:00,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:59" (2/3) ... [2019-01-02 00:17:00,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@792ca8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:00, skipping insertion in model container [2019-01-02 00:17:00,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:00,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:00" (3/3) ... [2019-01-02 00:17:00,245 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2019-01-02 00:17:00,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:17:00,307 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:17:00,308 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:17:00,308 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:17:00,308 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:17:00,308 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:17:00,308 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:17:00,308 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:17:00,309 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:17:00,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-02 00:17:00,348 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:00,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:00,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:00,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:17:00,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:00,356 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:17:00,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-02 00:17:00,359 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:00,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:00,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:00,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:17:00,360 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:00,368 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-02 00:17:00,369 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-02 00:17:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-02 00:17:00,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:00,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:00,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-02 00:17:00,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:00,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:00,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:00,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-02 00:17:00,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:00,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:00,860 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-02 00:17:01,050 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-02 00:17:01,061 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:01,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:01,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:01,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:01,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:01,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:01,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:01,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:01,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:17:01,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:01,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:01,092 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-02 00:17: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-02 00:17:01,138 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-02 00:17:01,140 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-02 00:17:01,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-02 00:17:01,155 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-02 00:17:01,432 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-02 00:17:01,479 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-02 00:17:01,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:01,500 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-02 00:17:01,507 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-02 00:17:01,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:01,515 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-02 00:17:01,524 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-02 00:17:01,526 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-02 00:17:01,529 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-02 00:17:01,531 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-02 00:17:01,552 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-02 00:17:01,557 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-02 00:17:01,959 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-02 00:17:02,375 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:02,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:02,385 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-02 00:17:02,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:02,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:02,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:02,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,405 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-02 00:17:02,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:02,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:02,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:02,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,409 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-02 00:17:02,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:02,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:02,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:02,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,417 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-02 00:17:02,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:02,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:02,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,434 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-02 00:17:02,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:02,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:02,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:02,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,438 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-02 00:17:02,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,439 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:17:02,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:17:02,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:02,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:02,472 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-02 00:17:02,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:02,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:02,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:02,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:02,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:02,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:02,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:02,663 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:17:02,664 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:17:02,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:02,668 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:02,669 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:02,669 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-02 00:17:02,726 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:17:02,737 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:17:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:02,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:02,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:02,896 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-02 00:17:02,911 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-02 00:17:02,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-01-02 00:17:03,141 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-02 00:17:03,142 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-02 00:17:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:17:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-02 00:17:03,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-02 00:17:03,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:03,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-02 00:17:03,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:03,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-02 00:17:03,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:03,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2019-01-02 00:17:03,155 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2019-01-02 00:17:03,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:17:03,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:03,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-01-02 00:17:03,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:03,162 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-01-02 00:17:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-02 00:17:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:17:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-01-02 00:17:03,194 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:03,195 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:03,195 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:17:03,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-01-02 00:17:03,197 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:03,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:03,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:17:03,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:03,198 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-02 00:17:03,198 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-02 00:17:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-02 00:17:03,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:03,252 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-02 00:17:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:03,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:17:03,255 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-01-02 00:17:03,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:17:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:17:03,379 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-02 00:17:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:03,395 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-01-02 00:17:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:17:03,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-01-02 00:17:03,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-01-02 00:17:03,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:03,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:03,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-01-02 00:17:03,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:03,400 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-02 00:17:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-01-02 00:17:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-02 00:17:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:17:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-02 00:17:03,403 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:17:03,403 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:17:03,403 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:17:03,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-02 00:17:03,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:03,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:03,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:17:03,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:03,405 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-02 00:17:03,405 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-02 00:17:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-02 00:17:03,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:03,464 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-02 00:17:03,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:03,464 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-02 00:17:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:03,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:03,540 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-02 00:17:03,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:03,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:17:03,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-01-02 00:17:03,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:17:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:17:03,695 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-02 00:17:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:03,747 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-01-02 00:17:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:03,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-02 00:17:03,749 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-01-02 00:17:03,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:03,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:03,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-02 00:17:03,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:03,751 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-02 00:17:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-02 00:17:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-02 00:17:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:17:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-02 00:17:03,755 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:17:03,755 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:17:03,756 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:17:03,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-02 00:17:03,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:03,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:03,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:03,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-02 00:17:03,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:03,759 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-02 00:17:03,759 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-02 00:17:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-02 00:17:03,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:03,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:03,838 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-02 00:17:03,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:03,839 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-02 00:17:03,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:03,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:03,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:03,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:03,938 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-02 00:17:03,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:03,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:17:03,968 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-01-02 00:17:03,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:03,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:17:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:17:04,162 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:17:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:04,195 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-02 00:17:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:04,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-02 00:17:04,198 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-01-02 00:17:04,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:04,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:04,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-02 00:17:04,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:04,200 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-02 00:17:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-02 00:17:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-02 00:17:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-02 00:17:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-02 00:17:04,205 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-02 00:17:04,205 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-02 00:17:04,205 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:17:04,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-02 00:17:04,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:04,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:04,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-02 00:17:04,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:04,209 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-02 00:17:04,209 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-02 00:17:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-02 00:17:04,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:04,300 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-02 00:17:04,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:04,301 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-02 00:17:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:04,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-02 00:17:04,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:04,359 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-02 00:17:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-02 00:17:04,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-01-02 00:17:04,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:04,453 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-02 00:17:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:04,511 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-02 00:17:04,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:17:04,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-02 00:17:04,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-01-02 00:17:04,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:04,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:04,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-02 00:17:04,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:04,516 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-02 00:17:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-02 00:17:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-02 00:17:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-02 00:17:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-02 00:17:04,520 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:17:04,520 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:17:04,520 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:17:04,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-02 00:17:04,522 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:04,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:04,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-02 00:17:04,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:04,523 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-02 00:17:04,524 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-02 00:17:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-02 00:17:04,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:04,731 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-02 00:17:04,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:04,732 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-02 00:17:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:17:04,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:17:04,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:04,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:04,782 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-02 00:17:04,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-02 00:17:04,804 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-01-02 00:17:04,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-02 00:17:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-02 00:17:04,865 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-01-02 00:17:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:04,911 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-02 00:17:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:17:04,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-02 00:17:04,915 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2019-01-02 00:17:04,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:04,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:04,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-02 00:17:04,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:04,917 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-02 00:17:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-02 00:17:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-02 00:17:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-02 00:17:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-02 00:17:04,922 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-02 00:17:04,922 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-02 00:17:04,922 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:17:04,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-02 00:17:04,923 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:04,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:04,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:04,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-02 00:17:04,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:04,924 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-02 00:17:04,924 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-02 00:17:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-02 00:17:04,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-01-02 00:17:04,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-01-02 00:17:04,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:04,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:05,032 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-02 00:17:05,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:05,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:17:05,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:17:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:17:05,123 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-02 00:17:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:05,203 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-01-02 00:17:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:17:05,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-01-02 00:17:05,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:05,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-01-02 00:17:05,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-02 00:17:05,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-02 00:17:05,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-01-02 00:17:05,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:05,210 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-01-02 00:17:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-01-02 00:17:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-02 00:17:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:17:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-01-02 00:17:05,214 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-02 00:17:05,214 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-02 00:17:05,214 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:17:05,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-01-02 00:17:05,216 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:05,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:05,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:05,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:05,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:05,218 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-02 00:17:05,219 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-02 00:17:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2019-01-02 00:17:05,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2019-01-02 00:17:05,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2019-01-02 00:17:05,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:05,398 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-02 00:17:05,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:05,398 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-02 00:17:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:05,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:05,473 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-02 00:17:05,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:05,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-02 00:17:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:17:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:17:05,537 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-02 00:17:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:05,618 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-02 00:17:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:05,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2019-01-02 00:17:05,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:05,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2019-01-02 00:17:05,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-02 00:17:05,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-02 00:17:05,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-01-02 00:17:05,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:05,624 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-01-02 00:17:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-01-02 00:17:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-02 00:17:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-02 00:17:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-02 00:17:05,628 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-02 00:17:05,628 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-02 00:17:05,628 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:17:05,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-01-02 00:17:05,629 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:05,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:05,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:05,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2019-01-02 00:17:05,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:05,631 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-02 00:17:05,631 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-02 00:17:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2019-01-02 00:17:05,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2019-01-02 00:17:05,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:05,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2019-01-02 00:17:05,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:05,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:05,899 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-02 00:17:05,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:05,900 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-02 00:17:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:05,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:05,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:05,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:05,957 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-02 00:17:05,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:05,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:17:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:17:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:17:06,101 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:17:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:06,191 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-01-02 00:17:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:06,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-01-02 00:17:06,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:17:06,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2019-01-02 00:17:06,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-02 00:17:06,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-02 00:17:06,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2019-01-02 00:17:06,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:06,198 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-01-02 00:17:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2019-01-02 00:17:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-01-02 00:17:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-02 00:17:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-01-02 00:17:06,202 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-02 00:17:06,202 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-02 00:17:06,202 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:17:06,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-01-02 00:17:06,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:06,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:06,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:06,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2019-01-02 00:17:06,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:06,207 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-02 00:17:06,207 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-02 00:17:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2019-01-02 00:17:06,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2019-01-02 00:17:06,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:06,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2019-01-02 00:17:06,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:07,240 WARN L181 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 119 [2019-01-02 00:17:07,322 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:07,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:07,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:07,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:07,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:07,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:07,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:07,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:07,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-02 00:17:07,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:07,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:07,330 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-02 00:17:07,508 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-02 00:17:07,579 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-02 00:17:07,583 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-02 00:17:07,585 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-02 00:17:07,588 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-02 00:17:07,594 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-02 00:17:07,598 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-02 00:17:07,601 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-02 00:17:07,603 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-02 00:17:07,605 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-02 00:17:07,609 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-02 00:17:07,612 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-02 00:17:07,614 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-02 00:17:07,617 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-02 00:17:07,619 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-02 00:17:07,622 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-02 00:17:07,624 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-02 00:17:07,626 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-02 00:17:07,628 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-02 00:17:07,632 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-02 00:17:07,634 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-02 00:17:07,638 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-02 00:17:07,639 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-02 00:17:08,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:08,038 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:08,038 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-02 00:17:08,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:08,041 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:17:08,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:08,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:08,045 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:17:08,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:08,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:08,057 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-02 00:17:08,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:08,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:08,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:08,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:08,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:08,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:08,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:08,075 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-02 00:17:08,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:08,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:08,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:08,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:08,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:08,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:08,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:08,087 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-02 00:17:08,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:08,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:08,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:08,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:08,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:08,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:08,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:08,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-02 00:17:08,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:08,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:08,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:08,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:08,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:08,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:08,123 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:08,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:17:08,143 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:17:08,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:08,144 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:08,145 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:08,145 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-02 00:17:08,292 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-02 00:17:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:08,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:08,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:08,505 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-02 00:17:08,506 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-02 00:17:08,506 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-02 00:17:08,543 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-02 00:17:08,545 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-02 00:17:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:17:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:17:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-02 00:17:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-02 00:17:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-02 00:17:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:08,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-01-02 00:17:08,550 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:08,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2019-01-02 00:17:08,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-02 00:17:08,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-02 00:17:08,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-02 00:17:08,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:08,552 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-02 00:17:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-02 00:17:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-02 00:17:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-02 00:17:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-01-02 00:17:08,557 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-02 00:17:08,557 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-02 00:17:08,557 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:17:08,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-01-02 00:17:08,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:08,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:08,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:08,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:08,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:08,562 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-02 00:17:08,562 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-02 00:17:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2019-01-02 00:17:08,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:08,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:08,693 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-02 00:17:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:17:08,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-01-02 00:17:08,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:08,854 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:08,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:17:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:17:08,875 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-02 00:17:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:08,930 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-01-02 00:17:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:08,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-01-02 00:17:08,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-01-02 00:17:08,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2019-01-02 00:17:08,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-02 00:17:08,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-02 00:17:08,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2019-01-02 00:17:08,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:08,936 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-01-02 00:17:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2019-01-02 00:17:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-01-02 00:17:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-02 00:17:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-01-02 00:17:08,941 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-02 00:17:08,941 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-02 00:17:08,942 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:17:08,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2019-01-02 00:17:08,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:17:08,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:08,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:08,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:08,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:08,947 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-02 00:17:08,947 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-02 00:17:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2019-01-02 00:17:08,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:08,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:09,185 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-02 00:17:09,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:09,186 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-02 00:17:09,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:09,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:09,451 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-02 00:17:09,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:17:09,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-02 00:17:09,485 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-01-02 00:17:09,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:09,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:09,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:09,629 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-02 00:17:09,704 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:09,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:09,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:09,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:09,704 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:17:09,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:09,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:09,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:09,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2019-01-02 00:17:09,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:09,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:09,705 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-02 00:17:09,719 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-02 00:17:09,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:09,823 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-02 00:17:09,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:17:09,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:17:09,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:17:09,843 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) [2019-01-02 00:17:09,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:17:09,885 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:17:09,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:17:09,941 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:09,999 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:17:10,001 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:10,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:10,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:10,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:10,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:10,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:10,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:10,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:10,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2019-01-02 00:17:10,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:10,002 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:10,002 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-02 00:17:10,009 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-02 00:17:10,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:10,057 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:10,058 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-02 00:17:10,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:10,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:10,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:10,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:10,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:10,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:10,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:10,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:10,066 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-02 00:17:10,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:10,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:10,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:10,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:10,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:10,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:10,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:10,072 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:10,073 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:17:10,073 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:17:10,073 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:10,073 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:17:10,074 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:10,074 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-02 00:17:10,074 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:17:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:10,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:10,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:10,299 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-02 00:17:10,299 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-02 00:17:10,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-02 00:17:10,393 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-02 00:17:10,394 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-02 00:17:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:17:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-01-02 00:17:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-02 00:17:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2019-01-02 00:17:10,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:10,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2019-01-02 00:17:10,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:10,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2019-01-02 00:17:10,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:10,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2019-01-02 00:17:10,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-02 00:17:10,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-02 00:17:10,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2019-01-02 00:17:10,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:10,404 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-01-02 00:17:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2019-01-02 00:17:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-02 00:17:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-02 00:17:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-01-02 00:17:10,410 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-01-02 00:17:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:10,410 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 7 states. [2019-01-02 00:17:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:11,206 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2019-01-02 00:17:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:17:11,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 107 transitions. [2019-01-02 00:17:11,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-02 00:17:11,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 104 transitions. [2019-01-02 00:17:11,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-02 00:17:11,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-02 00:17:11,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 104 transitions. [2019-01-02 00:17:11,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:11,210 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-01-02 00:17:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 104 transitions. [2019-01-02 00:17:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-01-02 00:17:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-02 00:17:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-01-02 00:17:11,217 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-02 00:17:11,219 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-02 00:17:11,219 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:17:11,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2019-01-02 00:17:11,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:11,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:11,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:11,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:11,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:11,222 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-02 00:17:11,222 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-02 00:17:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2019-01-02 00:17:11,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,235 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:11,235 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:11,235 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-02 00:17:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-01-02 00:17:11,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2019-01-02 00:17:11,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:11,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:11,393 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:11,394 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:11,394 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-02 00:17:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:11,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:11,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:11,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:11,552 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-02 00:17:11,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:11,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:17:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:17:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:17:11,673 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-02 00:17:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:12,229 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-02 00:17:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:12,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2019-01-02 00:17:12,232 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:17:12,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2019-01-02 00:17:12,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-02 00:17:12,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-01-02 00:17:12,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2019-01-02 00:17:12,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:12,234 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-02 00:17:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2019-01-02 00:17:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-01-02 00:17:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-02 00:17:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-01-02 00:17:12,239 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-01-02 00:17:12,239 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-01-02 00:17:12,239 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-02 00:17:12,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2019-01-02 00:17:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:17:12,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:12,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:12,245 INFO L866 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-02 00:17:12,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:12,245 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-02 00:17:12,249 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-02 00:17:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2019-01-02 00:17:12,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:12,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,267 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:12,267 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:12,267 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-02 00:17:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-01-02 00:17:12,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:12,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2019-01-02 00:17:12,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:12,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:12,453 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:12,454 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:12,454 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-02 00:17:12,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:12,753 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-02 00:17:17,004 WARN L181 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 338 DAG size of output: 254 [2019-01-02 00:17:40,409 WARN L181 SmtUtils]: Spent 21.32 s on a formula simplification. DAG size of input: 307 DAG size of output: 152 [2019-01-02 00:17:40,412 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:40,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:40,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:40,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:40,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:40,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:40,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:40,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:40,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-02 00:17:40,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:40,413 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:40,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:17:40,662 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-02 00:17:40,693 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-02 00:17:40,717 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-02 00:17:40,743 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-02 00:17:40,779 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-02 00:17:40,802 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-02 00:17:40,804 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-02 00:17:40,807 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-02 00:17:40,809 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-02 00:17:41,167 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-02 00:17:41,175 INFO L168 Benchmark]: Toolchain (without parser) took 42169.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 950.0 MB in the beginning and 859.0 MB in the end (delta: 91.0 MB). Peak memory consumption was 525.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,177 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:17:41,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.74 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.2 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,181 INFO L168 Benchmark]: Boogie Preprocessor took 158.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,182 INFO L168 Benchmark]: RCFGBuilder took 674.68 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,183 INFO L168 Benchmark]: BuchiAutomizer took 40933.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 859.0 MB in the end (delta: 245.4 MB). Peak memory consumption was 542.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:17:41,196 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.74 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.2 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 69.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.2 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 674.68 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40933.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 859.0 MB in the end (delta: 245.4 MB). Peak memory consumption was 542.6 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...