./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.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/sep.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 2de5f35db1963376882467da4793139d8556584c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:24:21,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:24:21,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:24:21,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:24:21,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:24:21,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:24:21,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:24:21,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:24:21,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:24:21,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:24:21,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:24:21,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:24:21,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:24:21,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:24:21,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:24:21,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:24:21,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:24:21,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:24:21,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:24:21,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:24:21,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:24:21,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:24:21,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:24:21,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:24:21,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:24:21,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:24:21,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:24:21,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:24:21,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:24:21,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:24:21,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:24:21,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:24:21,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:24:21,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:24:21,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:24:21,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:24:21,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:24:21,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:24:21,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:24:21,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:24:21,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:24:21,547 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:21,572 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:24:21,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:24:21,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:24:21,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:24:21,574 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:24:21,575 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:24:21,575 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:24:21,575 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:24:21,575 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:24:21,576 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:24:21,576 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:24:21,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:24:21,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:24:21,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:24:21,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:24:21,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:24:21,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:24:21,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:24:21,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:24:21,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:24:21,579 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:24:21,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:24:21,579 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:24:21,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:24:21,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:24:21,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:24:21,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:24:21,581 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:24:21,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:24:21,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:24:21,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:24:21,582 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:24:21,583 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:24:21,583 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 -> 2de5f35db1963376882467da4793139d8556584c [2020-10-19 20:24:21,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:24:21,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:24:21,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:24:21,900 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:24:21,900 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:24:21,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2020-10-19 20:24:21,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68868cb80/2702f9ceeb294a9ab448b9d38b5cbf4c/FLAG52662e590 [2020-10-19 20:24:22,425 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:24:22,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2020-10-19 20:24:22,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68868cb80/2702f9ceeb294a9ab448b9d38b5cbf4c/FLAG52662e590 [2020-10-19 20:24:22,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68868cb80/2702f9ceeb294a9ab448b9d38b5cbf4c [2020-10-19 20:24:22,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:24:22,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:24:22,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:22,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:24:22,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:24:22,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:22" (1/1) ... [2020-10-19 20:24:22,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1775d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:22, skipping insertion in model container [2020-10-19 20:24:22,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:22" (1/1) ... [2020-10-19 20:24:22,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:24:22,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:24:23,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:23,012 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:24:23,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:23,052 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:24:23,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:23 WrapperNode [2020-10-19 20:24:23,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:23,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:23,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:24:23,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:24:23,120 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:23" (1/1) ... [2020-10-19 20:24:23,130 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:23" (1/1) ... [2020-10-19 20:24:23,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:23,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:24:23,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:24:23,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:24:23,165 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:23" (1/1) ... [2020-10-19 20:24:23,165 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:23" (1/1) ... [2020-10-19 20:24:23,168 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:23" (1/1) ... [2020-10-19 20:24:23,168 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:23" (1/1) ... [2020-10-19 20:24:23,176 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:23" (1/1) ... [2020-10-19 20:24:23,181 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:23" (1/1) ... [2020-10-19 20:24:23,183 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:23" (1/1) ... [2020-10-19 20:24:23,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:24:23,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:24:23,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:24:23,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:24:23,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:23" (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:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:24:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:24:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:24:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:24:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:24:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:24:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:24:23,636 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:24:23,637 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-19 20:24:23,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:23 BoogieIcfgContainer [2020-10-19 20:24:23,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:24:23,644 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:24:23,644 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:24:23,648 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:24:23,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:23,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:24:22" (1/3) ... [2020-10-19 20:24:23,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42b1dc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:23, skipping insertion in model container [2020-10-19 20:24:23,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:23,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:23" (2/3) ... [2020-10-19 20:24:23,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42b1dc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:23, skipping insertion in model container [2020-10-19 20:24:23,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:23,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:23" (3/3) ... [2020-10-19 20:24:23,653 INFO L373 chiAutomizerObserver]: Analyzing ICFG sep.i [2020-10-19 20:24:23,692 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:24:23,693 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:24:23,693 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:24:23,693 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:24:23,693 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:24:23,693 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:24:23,693 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:24:23,693 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:24:23,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-19 20:24:23,725 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:23,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:23,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:23,732 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 20:24:23,732 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:23,732 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:24:23,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-19 20:24:23,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:23,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:23,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:23,736 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 20:24:23,736 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:23,744 INFO L794 eck$LassoCheckResult]: Stem: 27#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~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~1, 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; 16#L34true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L20-3true [2020-10-19 20:24:23,745 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 29#L22true assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 7#L20-2true sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 6#L20-3true [2020-10-19 20:24:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-19 20:24:23,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012646854] [2020-10-19 20:24:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2020-10-19 20:24:23,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717610593] [2020-10-19 20:24:23,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:23,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2020-10-19 20:24:23,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:23,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257213447] [2020-10-19 20:24:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:23,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:24,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:24,021 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:24,521 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-10-19 20:24:24,711 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-19 20:24:24,729 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:24,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:24,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:24,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:24,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:24,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:24,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:24,733 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:24,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2020-10-19 20:24:24,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:24,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:24,762 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:24,775 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:24,779 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:24,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:24,788 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:24,794 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:24,797 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:24,801 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:24,806 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:24,809 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:24,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:24,818 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:24,822 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:24,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:25,275 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-10-19 20:24:25,353 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:25,356 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:25,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:25,362 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:25,364 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:25,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:25,370 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:25,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:25,376 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:25,378 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:25,833 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:25,839 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:25,845 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:25,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:25,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:25,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:25,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:25,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:25,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:25,852 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:25,859 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:25,901 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:25,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:25,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:25,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:25,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:25,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:25,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:25,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:25,910 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 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:25,942 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:25,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:25,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:25,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:25,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:25,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:25,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:25,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:25,948 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:25,983 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:25,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:25,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:25,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:25,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:25,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:25,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:25,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:25,988 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:26,041 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:26,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,058 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:26,105 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:26,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:26,114 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:26,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:26,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:26,147 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:26,180 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:26,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:26,184 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:26,210 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:26,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:26,219 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:26,262 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:26,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,272 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:26,295 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:26,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:26,301 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:26,324 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:26,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,347 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:26,374 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:26,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:26,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:26,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:26,384 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:26,406 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:26,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,414 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) [2020-10-19 20:24:26,451 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:26,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,460 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:26,485 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:26,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:26,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:26,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:26,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:26,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:26,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:26,513 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:26,556 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:24:26,556 INFO L444 ModelExtractionUtils]: 13 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. 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:26,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:26,569 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:26,569 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:26,570 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-19 20:24:26,792 INFO L297 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2020-10-19 20:24:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:26,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:26,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:26,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:26,872 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:26,890 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:26,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2020-10-19 20:24:26,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 59 states and 85 transitions. Complement of second has 8 states. [2020-10-19 20:24:26,945 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:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2020-10-19 20:24:26,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-10-19 20:24:26,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:26,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-10-19 20:24:26,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:26,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-10-19 20:24:26,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:26,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 85 transitions. [2020-10-19 20:24:26,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:26,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 20 states and 29 transitions. [2020-10-19 20:24:26,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:24:26,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:26,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-10-19 20:24:26,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:26,965 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-19 20:24:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-10-19 20:24:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-19 20:24:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:24:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-19 20:24:26,994 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-19 20:24:26,994 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-19 20:24:26,994 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:24:26,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-19 20:24:26,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:26,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:26,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:26,996 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:24:26,996 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:26,997 INFO L794 eck$LassoCheckResult]: Stem: 302#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 299#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~1, 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; 300#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 290#L20-3 assume !(sep_~i~0 < ~N~0); 287#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 288#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 289#L20-8 [2020-10-19 20:24:26,997 INFO L796 eck$LassoCheckResult]: Loop: 289#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 297#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 298#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 289#L20-8 [2020-10-19 20:24:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2020-10-19 20:24:26,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:26,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475478415] [2020-10-19 20:24:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:27,087 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:27,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475478415] [2020-10-19 20:24:27,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:27,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:27,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440797819] [2020-10-19 20:24:27,093 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2020-10-19 20:24:27,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686584635] [2020-10-19 20:24:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,114 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:27,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:27,185 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:24:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:27,219 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-10-19 20:24:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:27,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2020-10-19 20:24:27,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:27,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2020-10-19 20:24:27,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:27,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:27,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2020-10-19 20:24:27,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:27,223 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-19 20:24:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2020-10-19 20:24:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-19 20:24:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:24:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-19 20:24:27,226 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:24:27,226 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:24:27,226 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:24:27,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-19 20:24:27,227 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:27,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:27,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:27,228 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:27,228 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:27,229 INFO L794 eck$LassoCheckResult]: Stem: 350#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 347#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~1, 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; 348#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 338#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 339#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 343#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 340#L20-3 assume !(sep_~i~0 < ~N~0); 335#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 336#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 337#L20-8 [2020-10-19 20:24:27,229 INFO L796 eck$LassoCheckResult]: Loop: 337#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 345#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 346#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 337#L20-8 [2020-10-19 20:24:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2020-10-19 20:24:27,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803409291] [2020-10-19 20:24:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:27,276 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:27,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803409291] [2020-10-19 20:24:27,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093804265] [2020-10-19 20:24:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:27,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:27,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:27,368 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:27,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:27,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-19 20:24:27,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989958074] [2020-10-19 20:24:27,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2020-10-19 20:24:27,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301186540] [2020-10-19 20:24:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:27,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:27,450 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-10-19 20:24:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:27,503 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-10-19 20:24:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:27,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-10-19 20:24:27,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:27,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2020-10-19 20:24:27,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:27,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:27,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-19 20:24:27,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:27,507 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:24:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-19 20:24:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-19 20:24:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 20:24:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-10-19 20:24:27,510 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 20:24:27,510 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 20:24:27,511 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:24:27,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-10-19 20:24:27,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:27,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:27,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:27,512 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:27,513 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:27,513 INFO L794 eck$LassoCheckResult]: Stem: 429#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 426#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~1, 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; 427#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 416#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 417#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 422#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 418#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 419#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 432#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 433#L20-3 assume !(sep_~i~0 < ~N~0); 413#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 414#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 415#L20-8 [2020-10-19 20:24:27,513 INFO L796 eck$LassoCheckResult]: Loop: 415#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 424#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 425#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 415#L20-8 [2020-10-19 20:24:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2020-10-19 20:24:27,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75659670] [2020-10-19 20:24:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2020-10-19 20:24:27,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906931910] [2020-10-19 20:24:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:27,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:27,598 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2020-10-19 20:24:27,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:27,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390725578] [2020-10-19 20:24:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:27,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390725578] [2020-10-19 20:24:27,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109855392] [2020-10-19 20:24:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:27,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:24:27,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:28,046 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-19 20:24:28,047 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2020-10-19 20:24:28,048 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:28,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:28,056 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:28,057 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-19 20:24:28,088 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2020-10-19 20:24:28,089 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:28,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:28,092 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:28,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:6 [2020-10-19 20:24:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:28,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:28,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-19 20:24:28,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721319888] [2020-10-19 20:24:28,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:24:28,177 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 13 states. [2020-10-19 20:24:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:28,944 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-10-19 20:24:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 20:24:28,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2020-10-19 20:24:28,951 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28 [2020-10-19 20:24:28,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 135 transitions. [2020-10-19 20:24:28,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-19 20:24:28,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-19 20:24:28,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 135 transitions. [2020-10-19 20:24:28,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:28,959 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 135 transitions. [2020-10-19 20:24:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 135 transitions. [2020-10-19 20:24:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 31. [2020-10-19 20:24:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:24:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-19 20:24:28,969 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:24:28,969 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:24:28,969 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:24:28,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-19 20:24:28,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 20:24:28,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:28,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:28,971 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:28,971 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:28,971 INFO L794 eck$LassoCheckResult]: Stem: 629#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 626#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~1, 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; 627#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 615#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 616#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 634#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 617#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 618#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 639#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 637#L20-3 assume !(sep_~i~0 < ~N~0); 636#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 613#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 614#L20-8 [2020-10-19 20:24:28,971 INFO L796 eck$LassoCheckResult]: Loop: 614#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 633#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 625#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 614#L20-8 [2020-10-19 20:24:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2020-10-19 20:24:28,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:28,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918481308] [2020-10-19 20:24:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:28,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:29,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,014 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2020-10-19 20:24:29,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:29,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504165601] [2020-10-19 20:24:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:29,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:29,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2020-10-19 20:24:29,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:29,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791596133] [2020-10-19 20:24:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:29,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:29,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:29,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:30,077 WARN L193 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 178 [2020-10-19 20:24:30,454 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2020-10-19 20:24:30,458 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:30,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:30,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:30,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:30,458 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:30,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:30,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:30,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:30,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2020-10-19 20:24:30,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:30,459 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:30,463 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:30,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:30,471 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:30,479 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:30,481 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:30,485 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:30,487 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:30,489 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:30,491 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:30,496 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:30,500 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:30,502 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:30,504 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:30,508 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:30,515 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:30,522 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:30,524 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:30,526 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:30,528 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:30,530 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:30,531 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:30,534 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:31,016 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-10-19 20:24:31,093 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:31,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:31,567 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:24:31,579 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:31,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,584 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 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:31,622 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:31,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,626 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,649 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:31,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,654 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:31,688 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:31,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,700 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,721 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:31,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:31,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:31,735 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 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:31,766 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:31,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:31,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:31,772 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,793 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:31,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,796 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,821 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:31,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:31,846 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,854 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:31,878 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:31,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:31,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,888 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,910 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:31,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,913 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:31,935 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:31,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,939 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:31,961 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:31,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:31,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:31,967 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:31,990 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:31,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:31,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:31,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:31,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:31,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:31,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:31,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:31,993 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:32,015 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:32,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,021 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,042 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:32,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,046 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:32,067 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:32,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,071 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:32,092 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:32,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,095 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:32,118 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:32,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,121 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:32,143 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:32,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,147 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:32,170 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:32,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,174 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 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:32,194 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:32,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,197 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,220 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:32,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,227 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,256 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:32,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:32,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:32,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:32,261 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,284 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:32,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,292 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,316 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:32,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,324 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,346 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:32,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,359 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,381 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:32,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,387 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,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:32,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:32,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:32,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:32,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:32,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:32,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:32,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:32,487 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:24:32,487 INFO L444 ModelExtractionUtils]: 4 out of 31 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:32,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:32,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:32,492 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:32,492 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_2, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_2 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-19 20:24:32,744 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2020-10-19 20:24:32,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:32,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:32,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:32,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:32,801 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:32,801 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:32,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-10-19 20:24:32,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2020-10-19 20:24:32,833 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:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-10-19 20:24:32,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2020-10-19 20:24:32,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:32,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 20:24:32,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:32,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2020-10-19 20:24:32,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:32,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2020-10-19 20:24:32,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:32,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2020-10-19 20:24:32,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:32,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:24:32,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2020-10-19 20:24:32,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:32,838 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-19 20:24:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2020-10-19 20:24:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-19 20:24:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:24:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-10-19 20:24:32,841 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-19 20:24:32,841 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-19 20:24:32,842 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:24:32,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-10-19 20:24:32,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:32,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:32,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:32,843 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:32,843 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:32,843 INFO L794 eck$LassoCheckResult]: Stem: 988#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 985#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~1, 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; 986#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 975#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 976#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 982#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 977#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 978#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 997#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 995#L20-3 assume !(sep_~i~0 < ~N~0); 994#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 973#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 974#L20-8 assume !(sep_~i~0 < ~N~0); 989#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 969#L27-1 main_#t~ret11 := sep_#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~1 := 0; 970#L46-3 [2020-10-19 20:24:32,844 INFO L796 eck$LassoCheckResult]: Loop: 970#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 990#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 970#L46-3 [2020-10-19 20:24:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:32,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2020-10-19 20:24:32,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:32,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105775079] [2020-10-19 20:24:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:24:32,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105775079] [2020-10-19 20:24:32,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:32,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:24:32,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791501831] [2020-10-19 20:24:32,881 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2020-10-19 20:24:32,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:32,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185607921] [2020-10-19 20:24:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:32,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:32,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:32,888 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:32,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:24:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:24:32,938 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-10-19 20:24:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:32,971 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2020-10-19 20:24:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:32,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2020-10-19 20:24:32,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:32,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2020-10-19 20:24:32,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-19 20:24:32,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 20:24:32,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2020-10-19 20:24:32,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:32,974 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2020-10-19 20:24:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2020-10-19 20:24:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-10-19 20:24:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:24:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-19 20:24:32,977 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 20:24:32,977 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 20:24:32,977 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:24:32,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-19 20:24:32,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:32,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:32,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:32,979 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:32,979 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:32,979 INFO L794 eck$LassoCheckResult]: Stem: 1063#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1060#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~1, 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; 1061#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1050#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1051#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1057#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1052#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1053#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1067#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1075#L20-3 assume !(sep_~i~0 < ~N~0); 1047#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1048#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1049#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1068#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1059#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1069#L20-8 assume !(sep_~i~0 < ~N~0); 1064#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1045#L27-1 main_#t~ret11 := sep_#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~1 := 0; 1046#L46-3 [2020-10-19 20:24:32,979 INFO L796 eck$LassoCheckResult]: Loop: 1046#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1065#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1046#L46-3 [2020-10-19 20:24:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2020-10-19 20:24:32,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:32,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055067753] [2020-10-19 20:24:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:24:33,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055067753] [2020-10-19 20:24:33,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765751948] [2020-10-19 20:24:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:33,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:33,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:24:33,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:33,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-19 20:24:33,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11750290] [2020-10-19 20:24:33,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2020-10-19 20:24:33,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:33,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554875829] [2020-10-19 20:24:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:33,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:33,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:33,106 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:33,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:33,158 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-19 20:24:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:33,239 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2020-10-19 20:24:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:33,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2020-10-19 20:24:33,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:33,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2020-10-19 20:24:33,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 20:24:33,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 20:24:33,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2020-10-19 20:24:33,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:33,242 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2020-10-19 20:24:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2020-10-19 20:24:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-10-19 20:24:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:24:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-10-19 20:24:33,245 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-19 20:24:33,245 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-19 20:24:33,245 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:24:33,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2020-10-19 20:24:33,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:33,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:33,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:33,246 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:33,246 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:33,247 INFO L794 eck$LassoCheckResult]: Stem: 1204#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1201#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~1, 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; 1202#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1190#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1191#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1215#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1192#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1193#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1208#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1219#L20-3 assume !(sep_~i~0 < ~N~0); 1218#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1217#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1216#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1214#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1211#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1210#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1199#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1200#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1212#L20-8 assume !(sep_~i~0 < ~N~0); 1205#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1185#L27-1 main_#t~ret11 := sep_#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~1 := 0; 1186#L46-3 [2020-10-19 20:24:33,247 INFO L796 eck$LassoCheckResult]: Loop: 1186#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1206#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1186#L46-3 [2020-10-19 20:24:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2020-10-19 20:24:33,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:33,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836117910] [2020-10-19 20:24:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:24:33,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836117910] [2020-10-19 20:24:33,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427373604] [2020-10-19 20:24:33,506 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:33,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:33,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:33,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:24:33,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:33,712 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-19 20:24:33,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2020-10-19 20:24:33,715 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:33,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:33,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:33,725 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2020-10-19 20:24:33,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-19 20:24:33,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:33,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:33,769 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:33,769 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-10-19 20:24:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:24:33,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:33,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-19 20:24:33,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519619387] [2020-10-19 20:24:33,798 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2020-10-19 20:24:33,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:33,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619146156] [2020-10-19 20:24:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:33,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:33,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:33,807 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:33,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:24:33,857 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand 13 states. [2020-10-19 20:24:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:34,304 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2020-10-19 20:24:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 20:24:34,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 103 transitions. [2020-10-19 20:24:34,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:24:34,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 103 transitions. [2020-10-19 20:24:34,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2020-10-19 20:24:34,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2020-10-19 20:24:34,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 103 transitions. [2020-10-19 20:24:34,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:34,309 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 103 transitions. [2020-10-19 20:24:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 103 transitions. [2020-10-19 20:24:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 35. [2020-10-19 20:24:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:24:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-19 20:24:34,312 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 20:24:34,312 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 20:24:34,312 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:24:34,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-19 20:24:34,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 20:24:34,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:34,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:34,314 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:34,314 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:34,314 INFO L794 eck$LassoCheckResult]: Stem: 1406#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1403#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~1, 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; 1404#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1393#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1394#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1399#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1395#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1396#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1421#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1415#L20-3 assume !(sep_~i~0 < ~N~0); 1416#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1391#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1392#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1420#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1414#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1413#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1401#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1402#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1419#L20-8 assume !(sep_~i~0 < ~N~0); 1407#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1387#L27-1 main_#t~ret11 := sep_#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~1 := 0; 1388#L46-3 [2020-10-19 20:24:34,314 INFO L796 eck$LassoCheckResult]: Loop: 1388#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1408#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1388#L46-3 [2020-10-19 20:24:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2020-10-19 20:24:34,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:34,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380767911] [2020-10-19 20:24:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2020-10-19 20:24:34,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:34,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207549708] [2020-10-19 20:24:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2020-10-19 20:24:34,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:34,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737866203] [2020-10-19 20:24:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:34,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:34,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:35,682 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 276 DAG size of output: 223 [2020-10-19 20:24:36,169 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 132 [2020-10-19 20:24:36,182 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:36,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:36,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:36,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:36,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:36,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:36,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:36,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:36,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration9_Lasso [2020-10-19 20:24:36,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:36,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:36,186 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:36,188 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:36,190 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:36,192 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:36,943 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2020-10-19 20:24:37,149 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2020-10-19 20:24:37,150 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:37,153 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:37,155 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:37,157 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:37,160 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:37,168 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:37,170 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:37,172 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:37,175 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:37,178 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:37,180 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:37,182 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:37,184 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:37,192 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:37,194 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:37,196 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:37,831 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:37,831 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:37,839 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:37,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:37,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:37,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:37,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:37,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:37,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:37,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:37,842 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:37,863 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:37,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:37,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:37,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:37,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:37,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:37,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:37,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:37,866 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:37,888 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:37,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:37,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:37,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:37,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:37,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:37,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:37,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:37,894 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:37,926 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:37,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:37,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:37,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:37,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:37,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:37,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:37,935 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:37,961 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:37,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:37,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:37,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:37,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:37,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:37,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:37,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:38,034 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-19 20:24:38,034 INFO L444 ModelExtractionUtils]: 1 out of 34 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:38,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:38,039 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:38,039 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:38,039 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2020-10-19 20:24:38,389 INFO L297 tatePredicateManager]: 76 out of 76 supporting invariants were superfluous and have been removed [2020-10-19 20:24:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:38,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:38,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:38,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:38,452 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:38,452 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:38,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-19 20:24:38,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 41 states and 56 transitions. Complement of second has 6 states. [2020-10-19 20:24:38,485 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:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-10-19 20:24:38,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2020-10-19 20:24:38,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:38,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2020-10-19 20:24:38,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:38,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2020-10-19 20:24:38,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:38,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2020-10-19 20:24:38,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:24:38,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 47 transitions. [2020-10-19 20:24:38,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:24:38,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:38,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2020-10-19 20:24:38,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:38,490 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-19 20:24:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2020-10-19 20:24:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-19 20:24:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 20:24:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-10-19 20:24:38,493 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-19 20:24:38,493 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-19 20:24:38,493 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:24:38,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-10-19 20:24:38,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:24:38,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:38,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:38,495 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:38,495 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:38,495 INFO L794 eck$LassoCheckResult]: Stem: 1878#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1875#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~1, 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; 1876#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1864#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1865#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1893#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1866#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1867#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1894#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1891#L20-3 assume !(sep_~i~0 < ~N~0); 1890#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1889#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1888#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1887#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1874#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1883#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1884#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1886#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1885#L20-8 assume !(sep_~i~0 < ~N~0); 1879#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1859#L27-1 main_#t~ret11 := sep_#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~1 := 0; 1860#L46-3 assume !(main_~i~1 < ~N~0 - 1); 1877#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1868#L20-13 [2020-10-19 20:24:38,495 INFO L796 eck$LassoCheckResult]: Loop: 1868#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1869#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1870#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1868#L20-13 [2020-10-19 20:24:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2020-10-19 20:24:38,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212272112] [2020-10-19 20:24:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 20:24:38,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212272112] [2020-10-19 20:24:38,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:38,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:24:38,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389858821] [2020-10-19 20:24:38,530 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2020-10-19 20:24:38,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906896362] [2020-10-19 20:24:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:24:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:24:38,596 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-19 20:24:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:38,620 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-10-19 20:24:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:38,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-19 20:24:38,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:24:38,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2020-10-19 20:24:38,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:38,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:38,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2020-10-19 20:24:38,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:38,623 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2020-10-19 20:24:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2020-10-19 20:24:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-10-19 20:24:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 20:24:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-10-19 20:24:38,626 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-19 20:24:38,626 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-19 20:24:38,626 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:24:38,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-10-19 20:24:38,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:24:38,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:38,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:38,627 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:38,627 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:38,628 INFO L794 eck$LassoCheckResult]: Stem: 1957#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1954#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~1, 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; 1955#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1944#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1945#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1951#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1946#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1947#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1974#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1971#L20-3 assume !(sep_~i~0 < ~N~0); 1941#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1942#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1943#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1961#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1963#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1962#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1952#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1953#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1964#L20-8 assume !(sep_~i~0 < ~N~0); 1958#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1939#L27-1 main_#t~ret11 := sep_#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~1 := 0; 1940#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1959#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1960#L46-3 assume !(main_~i~1 < ~N~0 - 1); 1956#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1948#L20-13 [2020-10-19 20:24:38,628 INFO L796 eck$LassoCheckResult]: Loop: 1948#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1949#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1950#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1948#L20-13 [2020-10-19 20:24:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2020-10-19 20:24:38,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177422493] [2020-10-19 20:24:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2020-10-19 20:24:38,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501441095] [2020-10-19 20:24:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,705 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2020-10-19 20:24:38,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037549344] [2020-10-19 20:24:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:24:39,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037549344] [2020-10-19 20:24:39,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400844674] [2020-10-19 20:24:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:39,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-19 20:24:39,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 20:24:39,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2020-10-19 20:24:39,650 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:39,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:39,660 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:39,660 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2020-10-19 20:24:39,845 INFO L350 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2020-10-19 20:24:39,846 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2020-10-19 20:24:39,847 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:39,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:39,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:39,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2020-10-19 20:24:40,042 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-10-19 20:24:40,043 INFO L350 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2020-10-19 20:24:40,043 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 96 [2020-10-19 20:24:40,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:24:40,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:24:40,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:24:40,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:24:40,072 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 20:24:40,122 INFO L625 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-10-19 20:24:40,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:24:40,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:40,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:66 [2020-10-19 20:24:40,234 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-10-19 20:24:40,236 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:24:40,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:24:40,238 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:24:40,239 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:15 [2020-10-19 20:24:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:24:40,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:40,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2020-10-19 20:24:40,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206918772] [2020-10-19 20:24:40,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-19 20:24:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-10-19 20:24:40,334 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 22 states. [2020-10-19 20:24:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:42,768 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-10-19 20:24:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-19 20:24:42,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 149 transitions. [2020-10-19 20:24:42,770 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-10-19 20:24:42,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 149 transitions. [2020-10-19 20:24:42,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-19 20:24:42,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-19 20:24:42,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 149 transitions. [2020-10-19 20:24:42,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:42,773 INFO L691 BuchiCegarLoop]: Abstraction has 118 states and 149 transitions. [2020-10-19 20:24:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 149 transitions. [2020-10-19 20:24:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 70. [2020-10-19 20:24:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-19 20:24:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2020-10-19 20:24:42,779 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-19 20:24:42,779 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-19 20:24:42,779 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:24:42,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 90 transitions. [2020-10-19 20:24:42,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:24:42,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:42,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:42,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:42,781 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:24:42,781 INFO L794 eck$LassoCheckResult]: Stem: 2265#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(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 2262#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~1, 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; 2263#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2251#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2252#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2257#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2253#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2254#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2297#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2280#L20-3 assume !(sep_~i~0 < ~N~0); 2281#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2249#L27 main_#t~ret8 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2250#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2288#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2289#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2276#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2277#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2287#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2285#L20-8 assume !(sep_~i~0 < ~N~0); 2266#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2267#L27-1 main_#t~ret11 := sep_#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~1 := 0; 2311#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 2310#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 2309#L46-3 assume !(main_~i~1 < ~N~0 - 1); 2264#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2255#L20-13 [2020-10-19 20:24:42,781 INFO L796 eck$LassoCheckResult]: Loop: 2255#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2256#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2259#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2255#L20-13 [2020-10-19 20:24:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1273346529, now seen corresponding path program 1 times [2020-10-19 20:24:42,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:42,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479399561] [2020-10-19 20:24:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,834 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2020-10-19 20:24:42,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:42,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750927894] [2020-10-19 20:24:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:42,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:42,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1115355784, now seen corresponding path program 1 times [2020-10-19 20:24:42,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:42,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359095648] [2020-10-19 20:24:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:42,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:42,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:44,572 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 321 DAG size of output: 253 [2020-10-19 20:24:44,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:24:44,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 20:24:44,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:24:44,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 20:24:45,663 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 231 DAG size of output: 144 [2020-10-19 20:24:45,666 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:45,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:45,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:45,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:45,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:45,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:45,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:45,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:45,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration12_Lasso [2020-10-19 20:24:45,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:45,667 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:45,669 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:45,671 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:45,673 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:45,675 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:45,681 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:45,683 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:45,688 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:45,690 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:45,693 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:45,696 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:45,699 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:45,701 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:46,325 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2020-10-19 20:24:46,428 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:46,431 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:46,433 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:46,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:46,444 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:46,446 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:46,448 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:46,457 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:46,459 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:46,462 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:46,722 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-19 20:24:47,024 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:47,025 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,033 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:47,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,037 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,058 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:47,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,061 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,083 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:47,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,086 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,107 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:47,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,112 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,135 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:47,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,141 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,162 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:47,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,169 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,190 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:47,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,199 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,225 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:47,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,229 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,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:47,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,258 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,280 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:47,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,283 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,305 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:47,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,309 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,332 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:47,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,343 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,365 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:47,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,368 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,390 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:47,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,394 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,415 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:47,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,418 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,440 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:47,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,446 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,468 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:47,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,476 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,497 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:47,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,505 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:47,536 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:47,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,550 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:47,574 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:47,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:47,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:47,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:47,577 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,598 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:47,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,604 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,627 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:47,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,636 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 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,661 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:47,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,670 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,692 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:47,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:47,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:47,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:47,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:47,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:47,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:47,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:47,762 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2020-10-19 20:24:47,762 INFO L444 ModelExtractionUtils]: 5 out of 34 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:47,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:47,767 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:47,767 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-19 20:24:48,002 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2020-10-19 20:24:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:48,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:48,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:48,071 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:48,072 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:48,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 90 transitions. cyclomatic complexity: 28 Second operand 3 states. [2020-10-19 20:24:48,081 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 90 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 74 states and 97 transitions. Complement of second has 4 states. [2020-10-19 20:24:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2020-10-19 20:24:48,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-19 20:24:48,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:48,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:24:48,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:48,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-19 20:24:48,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:48,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2020-10-19 20:24:48,085 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:48,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2020-10-19 20:24:48,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:24:48,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:24:48,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:24:48,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:48,085 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:48,085 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:48,085 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:48,086 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:24:48,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:24:48,086 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:48,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:24:48,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:24:48 BoogieIcfgContainer [2020-10-19 20:24:48,092 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:24:48,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:24:48,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:24:48,093 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:24:48,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:23" (3/4) ... [2020-10-19 20:24:48,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:24:48,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:24:48,098 INFO L168 Benchmark]: Toolchain (without parser) took 25323.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 958.6 MB in the beginning and 882.6 MB in the end (delta: 76.0 MB). Peak memory consumption was 558.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:48,099 INFO L168 Benchmark]: CDTParser took 0.28 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:48,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:48,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:48,100 INFO L168 Benchmark]: Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:48,100 INFO L168 Benchmark]: RCFGBuilder took 456.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:48,100 INFO L168 Benchmark]: BuchiAutomizer took 24447.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 1.1 GB in the beginning and 882.6 MB in the end (delta: 202.1 MB). Peak memory consumption was 557.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:48,101 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.5 GB. Free memory is still 882.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:48,102 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.28 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 271.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24447.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 1.1 GB in the beginning and 882.6 MB in the end (delta: 202.1 MB). Peak memory consumption was 557.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.5 GB. Free memory is still 882.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.4s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 19.8s. Construction of modules took 1.8s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 242 SDtfs, 464 SDslu, 618 SDs, 0 SdLazy, 2032 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital310 mio100 ax100 hnf99 lsp94 ukn58 mio100 lsp53 div100 bol100 ite100 ukn100 eq179 hnf89 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...