./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum.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 a9e9e68a4ced07da63a78ebad1c2cc86cbb57dae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-906a4fb [2020-10-19 20:24:15,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:24:15,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:24:15,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:24:15,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:24:15,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:24:15,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:24:15,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:24:15,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:24:15,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:24:15,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:24:15,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:24:15,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:24:15,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:24:15,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:24:15,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:24:15,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:24:15,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:24:15,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:24:15,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:24:15,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:24:15,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:24:15,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:24:15,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:24:15,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:24:15,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:24:15,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:24:15,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:24:15,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:24:15,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:24:15,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:24:15,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:24:15,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:24:15,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:24:15,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:24:15,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:24:15,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:24:15,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:24:15,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:24:15,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:24:15,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:24:15,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:24:15,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:24:15,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:24:15,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:24:15,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:24:15,274 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:24:15,274 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:24:15,274 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:24:15,274 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:24:15,275 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:24:15,275 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:24:15,276 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:24:15,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:24:15,277 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:24:15,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:24:15,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:24:15,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:24:15,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:24:15,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:24:15,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:24:15,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:24:15,279 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:24:15,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:24:15,279 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:24:15,280 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:24:15,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:24:15,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:24:15,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:24:15,281 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:24:15,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:24:15,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:24:15,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:24:15,282 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:24:15,284 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:24:15,284 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e9e68a4ced07da63a78ebad1c2cc86cbb57dae [2020-10-19 20:24:15,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:24:15,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:24:15,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:24:15,653 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:24:15,654 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:24:15,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-19 20:24:15,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9869b59cb/d831a1a5c2544dacb5bc630e48b7f154/FLAG28f9fd5db [2020-10-19 20:24:16,176 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:24:16,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2020-10-19 20:24:16,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9869b59cb/d831a1a5c2544dacb5bc630e48b7f154/FLAG28f9fd5db [2020-10-19 20:24:16,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9869b59cb/d831a1a5c2544dacb5bc630e48b7f154 [2020-10-19 20:24:16,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:24:16,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:24:16,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:16,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:24:16,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:24:16,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:16,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7449edf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16, skipping insertion in model container [2020-10-19 20:24:16,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:16,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:24:16,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:24:16,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:16,855 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:24:16,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:16,956 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:24:16,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16 WrapperNode [2020-10-19 20:24:16,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:16,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:16,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:24:16,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:24:16,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:16,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:17,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:24:17,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:24:17,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:24:17,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (1/1) ... [2020-10-19 20:24:17,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:24:17,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:24:17,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:24:17,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:24:17,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (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 [2020-10-19 20:24:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:24:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:24:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:24:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:24:17,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:24:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:24:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:24:17,507 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:24:17,507 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-19 20:24:17,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:17 BoogieIcfgContainer [2020-10-19 20:24:17,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:24:17,510 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:24:17,510 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:24:17,514 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:24:17,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:17,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:24:16" (1/3) ... [2020-10-19 20:24:17,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9287c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:17, skipping insertion in model container [2020-10-19 20:24:17,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:17,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:16" (2/3) ... [2020-10-19 20:24:17,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9287c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:17, skipping insertion in model container [2020-10-19 20:24:17,517 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:17,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:17" (3/3) ... [2020-10-19 20:24:17,519 INFO L373 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2020-10-19 20:24:17,565 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:24:17,566 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:24:17,566 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:24:17,566 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:24:17,566 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:24:17,567 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:24:17,567 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:24:17,567 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:24:17,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-19 20:24:17,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-19 20:24:17,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:17,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:17,608 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 20:24:17,608 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:17,609 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:24:17,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-19 20:24:17,612 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-19 20:24:17,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:17,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:17,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 20:24:17,613 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:17,619 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 32#L44true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 3#L18-3true [2020-10-19 20:24:17,620 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 7#L18-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3#L18-3true [2020-10-19 20:24:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-19 20:24:17,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:17,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448974611] [2020-10-19 20:24:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,802 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2020-10-19 20:24:17,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:17,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311694198] [2020-10-19 20:24:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,845 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2020-10-19 20:24:17,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:17,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250928392] [2020-10-19 20:24:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:17,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:17,902 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:18,248 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-19 20:24:18,384 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:18,384 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:18,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:18,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:18,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:18,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:18,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:18,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:18,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2020-10-19 20:24:18,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:18,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:18,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:18,724 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-19 20:24:19,120 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:19,126 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:19,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:19,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:19,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:19,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:19,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:19,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:19,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:19,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:19,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:19,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:19,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:19,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:19,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:19,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:19,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:19,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:19,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:19,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:19,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:19,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:19,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:19,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:20,063 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:24:20,063 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:20,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:20,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:20,074 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:20,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2020-10-19 20:24:20,145 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 20:24:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:20,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:20,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:20,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:20,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:20,249 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 [2020-10-19 20:24:20,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2020-10-19 20:24:20,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 89 states and 135 transitions. Complement of second has 7 states. [2020-10-19 20:24:20,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2020-10-19 20:24:20,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-19 20:24:20,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:20,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 20:24:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:20,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 93 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-19 20:24:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:20,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 135 transitions. [2020-10-19 20:24:20,383 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:20,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 23 states and 33 transitions. [2020-10-19 20:24:20,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 20:24:20,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 20:24:20,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2020-10-19 20:24:20,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:20,391 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-19 20:24:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2020-10-19 20:24:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-19 20:24:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 20:24:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2020-10-19 20:24:20,421 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-19 20:24:20,421 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-10-19 20:24:20,421 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:24:20,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2020-10-19 20:24:20,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:20,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:20,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:20,423 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:24:20,423 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:20,424 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 224#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 225#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 206#L18-3 assume !(init_nondet_~i~0 < ~N~0); 207#L16 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~mem6, rangesum_#t~post5, 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; 210#L29-3 [2020-10-19 20:24:20,424 INFO L796 eck$LassoCheckResult]: Loop: 210#L29-3 assume !!(rangesum_~i~1 < ~N~0); 212#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 218#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 210#L29-3 [2020-10-19 20:24:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2020-10-19 20:24:20,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:20,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844273583] [2020-10-19 20:24:20,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:20,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844273583] [2020-10-19 20:24:20,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:20,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:20,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458487196] [2020-10-19 20:24:20,485 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2020-10-19 20:24:20,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:20,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935003193] [2020-10-19 20:24:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:20,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:20,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:20,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:20,557 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:20,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:20,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:20,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:20,557 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:24:20,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:20,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:20,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:20,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-19 20:24:20,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:20,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:20,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:20,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:20,603 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:20,604 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:20,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:24:20,615 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:20,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:24:20,658 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:20,942 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:24:20,944 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:20,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:20,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:20,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:20,945 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:20,945 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:20,945 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:20,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:20,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2020-10-19 20:24:20,945 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:20,946 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:20,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:20,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:20,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:20,985 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:20,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:20,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:20,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:20,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:20,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:20,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:20,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:20,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:21,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:21,005 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 20:24:21,005 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:21,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:21,008 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:24:21,008 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:21,008 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2020-10-19 20:24:21,028 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:24:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:21,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:21,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:21,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:21,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:21,117 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 [2020-10-19 20:24:21,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-10-19 20:24:21,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2020-10-19 20:24:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:24:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-10-19 20:24:21,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 20:24:21,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:21,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 20:24:21,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:21,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 20:24:21,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:21,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2020-10-19 20:24:21,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2020-10-19 20:24:21,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:24:21,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 20:24:21,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2020-10-19 20:24:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:21,170 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-10-19 20:24:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2020-10-19 20:24:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-19 20:24:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:24:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2020-10-19 20:24:21,178 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-10-19 20:24:21,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:21,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:21,182 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2020-10-19 20:24:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:21,233 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-10-19 20:24:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:21,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2020-10-19 20:24:21,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2020-10-19 20:24:21,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:24:21,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-19 20:24:21,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2020-10-19 20:24:21,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:21,237 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-19 20:24:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2020-10-19 20:24:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-19 20:24:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:24:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-10-19 20:24:21,240 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-19 20:24:21,241 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-10-19 20:24:21,241 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:24:21,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-10-19 20:24:21,242 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:21,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:21,243 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:21,243 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:21,243 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 396#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 397#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 373#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 374#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 375#L18-3 assume !(init_nondet_~i~0 < ~N~0); 376#L16 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~mem6, rangesum_#t~post5, 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; 386#L29-3 assume !!(rangesum_~i~1 < ~N~0); 379#L30 [2020-10-19 20:24:21,243 INFO L796 eck$LassoCheckResult]: Loop: 379#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 388#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 377#L29-3 assume !!(rangesum_~i~1 < ~N~0); 379#L30 [2020-10-19 20:24:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2020-10-19 20:24:21,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076641913] [2020-10-19 20:24:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:21,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076641913] [2020-10-19 20:24:21,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765740501] [2020-10-19 20:24:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:21,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:21,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:21,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:21,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-19 20:24:21,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262142915] [2020-10-19 20:24:21,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2020-10-19 20:24:21,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767816293] [2020-10-19 20:24:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:21,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:21,453 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2020-10-19 20:24:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:21,512 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2020-10-19 20:24:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:21,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2020-10-19 20:24:21,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2020-10-19 20:24:21,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:24:21,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-19 20:24:21,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2020-10-19 20:24:21,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:21,515 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-10-19 20:24:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2020-10-19 20:24:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-19 20:24:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:24:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-10-19 20:24:21,519 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-19 20:24:21,519 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-10-19 20:24:21,519 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:24:21,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2020-10-19 20:24:21,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:21,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:21,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:21,521 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:21,521 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 488#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 489#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 464#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 465#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 466#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 467#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 494#L18-3 assume !(init_nondet_~i~0 < ~N~0); 478#L16 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~mem6, rangesum_#t~post5, 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; 479#L29-3 assume !!(rangesum_~i~1 < ~N~0); 470#L30 [2020-10-19 20:24:21,521 INFO L796 eck$LassoCheckResult]: Loop: 470#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 480#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 468#L29-3 assume !!(rangesum_~i~1 < ~N~0); 470#L30 [2020-10-19 20:24:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2020-10-19 20:24:21,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965860307] [2020-10-19 20:24:21,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,561 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:21,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,562 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2020-10-19 20:24:21,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87166395] [2020-10-19 20:24:21,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,578 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2020-10-19 20:24:21,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670113522] [2020-10-19 20:24:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:24:21,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670113522] [2020-10-19 20:24:21,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:21,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:24:21,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989389103] [2020-10-19 20:24:21,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:24:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:24:21,723 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-10-19 20:24:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:21,801 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-10-19 20:24:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:21,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2020-10-19 20:24:21,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2020-10-19 20:24:21,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 20:24:21,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 20:24:21,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-10-19 20:24:21,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:21,804 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-10-19 20:24:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-10-19 20:24:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-19 20:24:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 20:24:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-10-19 20:24:21,812 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-19 20:24:21,812 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-19 20:24:21,812 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:24:21,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-10-19 20:24:21,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:21,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:21,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:21,815 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:21,815 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:21,816 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 569#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 570#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 544#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 545#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 546#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 547#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 578#L18-3 assume !(init_nondet_~i~0 < ~N~0); 556#L16 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~mem6, rangesum_#t~post5, 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; 548#L29-3 assume !!(rangesum_~i~1 < ~N~0); 549#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 567#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 577#L29-3 assume !!(rangesum_~i~1 < ~N~0); 566#L30 [2020-10-19 20:24:21,816 INFO L796 eck$LassoCheckResult]: Loop: 566#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 558#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 559#L29-3 assume !!(rangesum_~i~1 < ~N~0); 566#L30 [2020-10-19 20:24:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2020-10-19 20:24:21,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779546620] [2020-10-19 20:24:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,908 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2020-10-19 20:24:21,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790431927] [2020-10-19 20:24:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:21,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:21,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2020-10-19 20:24:21,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:21,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022621336] [2020-10-19 20:24:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:22,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022621336] [2020-10-19 20:24:22,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950063749] [2020-10-19 20:24:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:22,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:24:22,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:22,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:22,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-19 20:24:22,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208540542] [2020-10-19 20:24:22,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:24:22,233 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 13 states. [2020-10-19 20:24:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:22,542 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2020-10-19 20:24:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 20:24:22,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2020-10-19 20:24:22,545 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2020-10-19 20:24:22,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 70 states and 90 transitions. [2020-10-19 20:24:22,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-19 20:24:22,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-19 20:24:22,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2020-10-19 20:24:22,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:22,547 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-19 20:24:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2020-10-19 20:24:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2020-10-19 20:24:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-19 20:24:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2020-10-19 20:24:22,552 INFO L714 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-19 20:24:22,552 INFO L594 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-19 20:24:22,552 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:24:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2020-10-19 20:24:22,553 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-19 20:24:22,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:22,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:22,554 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:22,554 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:22,555 INFO L794 eck$LassoCheckResult]: Stem: 767#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 761#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 762#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 735#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 736#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 737#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 738#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 778#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 779#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 787#L18-3 assume !(init_nondet_~i~0 < ~N~0); 786#L16 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~mem6, rangesum_#t~post5, 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; 785#L29-3 assume !!(rangesum_~i~1 < ~N~0); 759#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 752#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 753#L29-3 assume !!(rangesum_~i~1 < ~N~0); 789#L30 [2020-10-19 20:24:22,555 INFO L796 eck$LassoCheckResult]: Loop: 789#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 791#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 790#L29-3 assume !!(rangesum_~i~1 < ~N~0); 789#L30 [2020-10-19 20:24:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2020-10-19 20:24:22,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:22,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290318948] [2020-10-19 20:24:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:22,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:22,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:22,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2020-10-19 20:24:22,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:22,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970431301] [2020-10-19 20:24:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:22,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:22,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:22,598 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2020-10-19 20:24:22,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:22,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551167871] [2020-10-19 20:24:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:22,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551167871] [2020-10-19 20:24:22,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714924840] [2020-10-19 20:24:22,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:22,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:22,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:22,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:24:22,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:22,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:22,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-19 20:24:22,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961873757] [2020-10-19 20:24:22,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:22,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 20:24:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-19 20:24:22,967 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 14 states. [2020-10-19 20:24:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:23,417 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-10-19 20:24:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:24:23,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2020-10-19 20:24:23,420 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2020-10-19 20:24:23,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 73 states and 87 transitions. [2020-10-19 20:24:23,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-19 20:24:23,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-19 20:24:23,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2020-10-19 20:24:23,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:23,424 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2020-10-19 20:24:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2020-10-19 20:24:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2020-10-19 20:24:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-19 20:24:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2020-10-19 20:24:23,440 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-19 20:24:23,440 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-10-19 20:24:23,440 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:24:23,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2020-10-19 20:24:23,441 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-19 20:24:23,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:23,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:23,442 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-19 20:24:23,443 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:23,443 INFO L794 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 978#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 979#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 954#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 955#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 956#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 957#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1016#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 992#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 991#L18-3 assume !(init_nondet_~i~0 < ~N~0); 967#L16 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~mem6, rangesum_#t~post5, 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; 958#L29-3 assume !!(rangesum_~i~1 < ~N~0); 959#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 970#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 960#L29-3 assume !!(rangesum_~i~1 < ~N~0); 961#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1012#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1008#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1007#L30 [2020-10-19 20:24:23,445 INFO L796 eck$LassoCheckResult]: Loop: 1007#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1011#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1006#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1007#L30 [2020-10-19 20:24:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 3 times [2020-10-19 20:24:23,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390808201] [2020-10-19 20:24:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,498 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2020-10-19 20:24:23,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983155195] [2020-10-19 20:24:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,517 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 3 times [2020-10-19 20:24:23,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538470292] [2020-10-19 20:24:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-19 20:24:23,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538470292] [2020-10-19 20:24:23,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843738145] [2020-10-19 20:24:23,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:23,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 20:24:23,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:23,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:24:23,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:23,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:23,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-19 20:24:23,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946802749] [2020-10-19 20:24:23,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-19 20:24:23,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-19 20:24:23,910 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 15 states. [2020-10-19 20:24:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:24,350 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-10-19 20:24:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-19 20:24:24,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2020-10-19 20:24:24,354 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2020-10-19 20:24:24,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2020-10-19 20:24:24,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-10-19 20:24:24,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-10-19 20:24:24,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2020-10-19 20:24:24,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:24,357 INFO L691 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2020-10-19 20:24:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2020-10-19 20:24:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2020-10-19 20:24:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-19 20:24:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2020-10-19 20:24:24,363 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-19 20:24:24,363 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-10-19 20:24:24,363 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:24:24,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2020-10-19 20:24:24,364 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-10-19 20:24:24,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:24,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:24,365 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-19 20:24:24,365 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:24,365 INFO L794 eck$LassoCheckResult]: Stem: 1276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 1270#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1271#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 1243#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1244#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1245#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1246#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1308#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1255#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1256#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1303#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1302#L18-3 assume !(init_nondet_~i~0 < ~N~0); 1301#L16 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~mem6, rangesum_#t~post5, 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; 1300#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1268#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1261#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1262#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1299#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1297#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1294#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1295#L30 [2020-10-19 20:24:24,365 INFO L796 eck$LassoCheckResult]: Loop: 1295#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1298#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1296#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1295#L30 [2020-10-19 20:24:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 4 times [2020-10-19 20:24:24,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:24,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837965268] [2020-10-19 20:24:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:24,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:24,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,395 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:24,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2020-10-19 20:24:24,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:24,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648705030] [2020-10-19 20:24:24,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:24,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:24,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 4 times [2020-10-19 20:24:24,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:24,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972711066] [2020-10-19 20:24:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-19 20:24:24,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972711066] [2020-10-19 20:24:24,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915979901] [2020-10-19 20:24:24,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:24,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 20:24:24,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:24,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:24:24,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:24,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:24,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-10-19 20:24:24,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601170293] [2020-10-19 20:24:24,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:24,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-19 20:24:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-19 20:24:24,748 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 18 states. [2020-10-19 20:24:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:25,630 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2020-10-19 20:24:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-19 20:24:25,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 191 transitions. [2020-10-19 20:24:25,632 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 23 [2020-10-19 20:24:25,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 158 states and 185 transitions. [2020-10-19 20:24:25,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2020-10-19 20:24:25,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2020-10-19 20:24:25,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 185 transitions. [2020-10-19 20:24:25,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:25,635 INFO L691 BuchiCegarLoop]: Abstraction has 158 states and 185 transitions. [2020-10-19 20:24:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 185 transitions. [2020-10-19 20:24:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2020-10-19 20:24:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-19 20:24:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2020-10-19 20:24:25,642 INFO L714 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-19 20:24:25,642 INFO L594 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2020-10-19 20:24:25,642 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:24:25,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 165 transitions. [2020-10-19 20:24:25,644 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2020-10-19 20:24:25,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:25,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:25,645 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2020-10-19 20:24:25,645 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:25,645 INFO L794 eck$LassoCheckResult]: Stem: 1661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 1657#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1658#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 1631#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1632#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1633#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1634#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1709#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1710#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1721#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1675#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1676#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1671#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1669#L18-3 assume !(init_nondet_~i~0 < ~N~0); 1670#L16 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~mem6, rangesum_#t~post5, 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; 1635#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1636#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1648#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1637#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1638#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1739#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1740#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1731#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1730#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1723#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1726#L30 [2020-10-19 20:24:25,645 INFO L796 eck$LassoCheckResult]: Loop: 1726#L30 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1646#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1647#L29-3 assume !!(rangesum_~i~1 < ~N~0); 1726#L30 [2020-10-19 20:24:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 5 times [2020-10-19 20:24:25,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:25,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008370289] [2020-10-19 20:24:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,670 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 7 times [2020-10-19 20:24:25,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:25,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787622434] [2020-10-19 20:24:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,678 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 5 times [2020-10-19 20:24:25,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:25,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018182853] [2020-10-19 20:24:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:25,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:25,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:27,074 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 209 DAG size of output: 152 [2020-10-19 20:24:27,421 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-19 20:24:27,423 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:27,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:27,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:27,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:27,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:27,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:27,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:27,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:27,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2020-10-19 20:24:27,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:27,425 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:27,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,748 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-19 20:24:27,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:27,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:28,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:28,235 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:28,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:28,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:28,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:28,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:28,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:28,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:28,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:28,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:28,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:28,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:28,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:28,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:28,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:28,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:28,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:28,555 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 20:24:28,555 INFO L444 ModelExtractionUtils]: 19 out of 34 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:28,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:28,559 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:28,559 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:28,559 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2020-10-19 20:24:28,617 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 20:24:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:28,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:28,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:28,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:28,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:28,672 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 [2020-10-19 20:24:28,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 165 transitions. cyclomatic complexity: 37 Second operand 4 states. [2020-10-19 20:24:28,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 165 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 178 states and 215 transitions. Complement of second has 7 states. [2020-10-19 20:24:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:24:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-19 20:24:28,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-19 20:24:28,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:28,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:24:28,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:28,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-19 20:24:28,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:28,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 215 transitions. [2020-10-19 20:24:28,726 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-19 20:24:28,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 148 states and 176 transitions. [2020-10-19 20:24:28,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-10-19 20:24:28,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-10-19 20:24:28,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 176 transitions. [2020-10-19 20:24:28,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:24:28,728 INFO L691 BuchiCegarLoop]: Abstraction has 148 states and 176 transitions. [2020-10-19 20:24:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 176 transitions. [2020-10-19 20:24:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2020-10-19 20:24:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-19 20:24:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2020-10-19 20:24:28,742 INFO L714 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-19 20:24:28,742 INFO L594 BuchiCegarLoop]: Abstraction has 142 states and 170 transitions. [2020-10-19 20:24:28,742 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:24:28,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 170 transitions. [2020-10-19 20:24:28,745 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2020-10-19 20:24:28,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:28,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:28,746 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:28,746 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:28,747 INFO L794 eck$LassoCheckResult]: Stem: 2129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11);~N~0 := 0; 2126#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~2, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 2127#L44 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, 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; 2100#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2101#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2171#L18-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2170#L18-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2168#L18-3 assume !(init_nondet_~i~0 < ~N~0); 2167#L16 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~mem6, rangesum_#t~post5, 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; 2166#L29-3 assume !!(rangesum_~i~1 < ~N~0); 2165#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2164#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2163#L29-3 assume !!(rangesum_~i~1 < ~N~0); 2162#L30 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2161#L29-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2159#L29-3 assume !(rangesum_~i~1 < ~N~0); 2157#L29-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2155#L38 main_#t~ret8 := rangesum_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;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~mem6, rangesum_#t~post5, 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; 2153#L29-8 assume !!(rangesum_~i~1 < ~N~0); 2151#L30-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2149#L29-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2147#L29-8 assume !!(rangesum_~i~1 < ~N~0); 2145#L30-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2144#L29-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2140#L29-8 assume !(rangesum_~i~1 < ~N~0); 2139#L29-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2138#L38-1 main_#t~ret11 := rangesum_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~2 := 0; 2132#L57-3 [2020-10-19 20:24:28,749 INFO L796 eck$LassoCheckResult]: Loop: 2132#L57-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem14; 2133#L57-2 main_#t~post13 := main_~i~2;main_~i~2 := 1 + main_#t~post13;havoc main_#t~post13; 2132#L57-3 [2020-10-19 20:24:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2020-10-19 20:24:28,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:28,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147946942] [2020-10-19 20:24:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2020-10-19 20:24:28,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:28,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170167732] [2020-10-19 20:24:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,798 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2020-10-19 20:24:28,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:28,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224978728] [2020-10-19 20:24:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:28,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:30,060 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 215 DAG size of output: 178 [2020-10-19 20:24:35,337 WARN L193 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 168 DAG size of output: 147 [2020-10-19 20:24:35,342 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:35,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:35,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:35,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:35,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:35,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:35,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:35,342 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:35,342 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2020-10-19 20:24:35,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:35,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:35,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:35,713 FATAL L? ?]: 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) 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:957) 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:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:320) 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) [2020-10-19 20:24:35,716 INFO L168 Benchmark]: Toolchain (without parser) took 19117.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 960.0 MB in the beginning and 1.2 GB in the end (delta: -281.8 MB). Peak memory consumption was 454.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,717 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:35,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,720 INFO L168 Benchmark]: Boogie Preprocessor took 35.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,720 INFO L168 Benchmark]: RCFGBuilder took 468.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,721 INFO L168 Benchmark]: BuchiAutomizer took 18204.97 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -191.1 MB). Peak memory consumption was 456.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:35,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 468.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18204.97 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -191.1 MB). Peak memory consumption was 456.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...