./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.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/max10-1.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 26bc4a4da598eefeae13591143340a28d87c3535 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:23:55,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:23:55,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:23:55,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:23:55,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:23:55,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:23:55,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:23:55,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:23:55,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:23:55,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:23:55,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:23:55,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:23:55,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:23:55,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:23:55,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:23:55,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:23:55,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:23:55,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:23:55,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:23:55,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:23:55,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:23:55,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:23:55,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:23:55,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:23:55,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:23:55,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:23:55,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:23:55,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:23:55,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:23:55,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:23:55,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:23:55,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:23:55,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:23:55,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:23:55,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:23:55,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:23:55,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:23:55,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:23:55,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:23:55,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:23:55,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:23:55,741 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:23:55,769 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:23:55,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:23:55,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:23:55,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:23:55,771 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:23:55,772 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:23:55,772 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:23:55,772 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:23:55,773 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:23:55,773 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:23:55,773 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:23:55,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:23:55,774 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:23:55,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:23:55,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:23:55,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:23:55,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:23:55,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:23:55,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:23:55,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:23:55,776 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:23:55,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:23:55,777 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:23:55,777 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:23:55,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:23:55,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:23:55,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:23:55,779 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:23:55,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:23:55,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:23:55,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:23:55,782 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:23:55,783 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:23:55,783 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 -> 26bc4a4da598eefeae13591143340a28d87c3535 [2020-10-19 20:23:56,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:23:56,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:23:56,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:23:56,122 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:23:56,123 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:23:56,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2020-10-19 20:23:56,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b8f265b/0cfd20c64f334e5eaa414ffb5fa38da3/FLAG4f699d8c5 [2020-10-19 20:23:56,673 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:23:56,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2020-10-19 20:23:56,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b8f265b/0cfd20c64f334e5eaa414ffb5fa38da3/FLAG4f699d8c5 [2020-10-19 20:23:57,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b8f265b/0cfd20c64f334e5eaa414ffb5fa38da3 [2020-10-19 20:23:57,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:23:57,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:23:57,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:23:57,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:23:57,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:23:57,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769d862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57, skipping insertion in model container [2020-10-19 20:23:57,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:23:57,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:23:57,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:23:57,281 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:23:57,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:23:57,385 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:23:57,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57 WrapperNode [2020-10-19 20:23:57,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:23:57,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:23:57,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:23:57,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:23:57,397 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:23:57" (1/1) ... [2020-10-19 20:23:57,408 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:23:57" (1/1) ... [2020-10-19 20:23:57,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:23:57,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:23:57,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:23:57,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:23:57,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (1/1) ... [2020-10-19 20:23:57,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:23:57,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:23:57,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:23:57,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:23:57,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (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:23:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:23:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:23:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:23:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:23:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:23:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:23:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:23:58,073 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:23:58,074 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-19 20:23:58,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:58 BoogieIcfgContainer [2020-10-19 20:23:58,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:23:58,078 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:23:58,079 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:23:58,083 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:23:58,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:58,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:23:57" (1/3) ... [2020-10-19 20:23:58,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e4e56e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:23:58, skipping insertion in model container [2020-10-19 20:23:58,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:58,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:57" (2/3) ... [2020-10-19 20:23:58,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e4e56e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:23:58, skipping insertion in model container [2020-10-19 20:23:58,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:58,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:58" (3/3) ... [2020-10-19 20:23:58,092 INFO L373 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2020-10-19 20:23:58,156 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:23:58,156 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:23:58,156 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:23:58,157 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:23:58,157 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:23:58,158 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:23:58,158 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:23:58,158 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:23:58,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-19 20:23:58,194 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-19 20:23:58,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:58,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:58,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:23:58,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:23:58,201 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:23:58,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-19 20:23:58,204 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-19 20:23:58,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:58,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:58,205 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:23:58,205 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:23:58,212 INFO L794 eck$LassoCheckResult]: Stem: 33#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(10); 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-10-19 20:23:58,212 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 12#L34-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 9#L34-3true [2020-10-19 20:23:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 20:23:58,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:58,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424204457] [2020-10-19 20:23:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 20:23:58,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:58,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965959939] [2020-10-19 20:23:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 20:23:58,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:58,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111065875] [2020-10-19 20:23:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:58,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:58,468 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:58,707 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-19 20:23:58,818 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:23:58,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:23:58,819 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:23:58,819 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:23:58,820 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:23:58,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:58,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:23:58,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:23:58,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2020-10-19 20:23:58,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:23:58,821 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:23:58,847 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:23:58,854 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:23:58,858 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:23:58,861 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:23:58,866 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:23:58,869 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:23:58,873 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:23:58,880 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:23:58,885 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:23:58,889 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:23:58,894 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:23:58,897 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:23:58,900 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:23:58,903 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:23:58,907 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:23:58,912 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:23:58,916 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:23:59,121 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:23:59,125 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:23:59,435 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:23:59,441 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:23:59,448 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:23:59,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,455 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:23:59,459 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:23:59,513 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:23:59,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,519 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:23:59,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:59,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,564 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:23:59,589 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:23:59,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:59,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:59,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:23:59,640 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:23:59,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,652 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:59,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,685 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:23:59,712 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:23:59,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,725 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:23:59,758 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:23:59,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:59,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:59,769 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) [2020-10-19 20:23:59,814 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:23:59,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,820 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) [2020-10-19 20:23:59,858 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:59,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:59,867 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:23:59,897 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:23:59,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,901 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) [2020-10-19 20:23:59,946 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:23:59,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,958 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:23:59,982 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:23:59,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:59,991 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:00,014 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:00,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,047 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:00,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,055 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:00,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:00,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,137 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:00,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,173 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:00,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,204 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:00,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,272 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:00,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,280 INFO L402 nArgumentSynthesizer]: A total of 2 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:00,289 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) [2020-10-19 20:24:00,334 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:00,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,344 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) [2020-10-19 20:24:00,383 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:00,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,391 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00,457 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:00,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,465 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:00,489 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:00,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,503 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) [2020-10-19 20:24:00,560 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:00,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:00,666 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:24:00,666 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. 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) [2020-10-19 20:24:00,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,676 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:00,677 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:00,678 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2020-10-19 20:24:00,736 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:24:00,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:00,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:00,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:00,806 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:00,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:00,839 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:00,858 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:00,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-19 20:24:00,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 87 states and 124 transitions. Complement of second has 8 states. [2020-10-19 20:24:00,976 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:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-19 20:24:00,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 20:24:00,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:00,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:24:00,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:00,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 20:24:00,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:00,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-19 20:24:00,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:00,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-19 20:24:00,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:24:00,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:00,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-19 20:24:01,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,000 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:24:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-19 20:24:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-19 20:24:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:24:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-19 20:24:01,033 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:24:01,033 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:24:01,033 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:24:01,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-19 20:24:01,034 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,035 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:24:01,035 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,036 INFO L794 eck$LassoCheckResult]: Stem: 208#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(10); 204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 205#L34-3 assume !(main_~i~1 < 10); 203#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 193#L20-3 [2020-10-19 20:24:01,036 INFO L796 eck$LassoCheckResult]: Loop: 193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 194#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 193#L20-3 [2020-10-19 20:24:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-19 20:24:01,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617267524] [2020-10-19 20:24:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,085 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:01,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617267524] [2020-10-19 20:24:01,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:01,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:01,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63737272] [2020-10-19 20:24:01,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-19 20:24:01,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958012170] [2020-10-19 20:24:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:01,165 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:24:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,181 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-19 20:24:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:01,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-19 20:24:01,183 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-19 20:24:01,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:01,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:01,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-19 20:24:01,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,186 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-19 20:24:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-19 20:24:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-19 20:24:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:24:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-19 20:24:01,189 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-19 20:24:01,189 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-19 20:24:01,189 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:24:01,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-19 20:24:01,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,192 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:24:01,192 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,192 INFO L794 eck$LassoCheckResult]: Stem: 265#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(10); 261#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 262#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 263#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 264#L34-3 assume !(main_~i~1 < 10); 260#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 250#L20-3 [2020-10-19 20:24:01,192 INFO L796 eck$LassoCheckResult]: Loop: 250#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 251#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 259#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 254#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 250#L20-3 [2020-10-19 20:24:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-19 20:24:01,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891530849] [2020-10-19 20:24:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,239 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:01,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891530849] [2020-10-19 20:24:01,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143623667] [2020-10-19 20:24:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,327 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:01,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:24:01,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677137136] [2020-10-19 20:24:01,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-19 20:24:01,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773903287] [2020-10-19 20:24:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,351 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:24:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:24:01,390 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:24:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,410 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-19 20:24:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:01,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-19 20:24:01,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-19 20:24:01,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:01,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:01,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-19 20:24:01,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,415 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-19 20:24:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-19 20:24:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-19 20:24:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:24:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-19 20:24:01,418 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-19 20:24:01,418 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-19 20:24:01,419 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:24:01,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-19 20:24:01,420 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,421 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 20:24:01,421 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,421 INFO L794 eck$LassoCheckResult]: Stem: 342#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(10); 337#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 338#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 339#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 340#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 341#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 346#L34-3 assume !(main_~i~1 < 10); 336#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 326#L20-3 [2020-10-19 20:24:01,421 INFO L796 eck$LassoCheckResult]: Loop: 326#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 327#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 335#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 330#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 326#L20-3 [2020-10-19 20:24:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-19 20:24:01,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211959308] [2020-10-19 20:24:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211959308] [2020-10-19 20:24:01,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743349251] [2020-10-19 20:24:01,460 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:01,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:01,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:01,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:24:01,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037406606] [2020-10-19 20:24:01,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-19 20:24:01,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86744647] [2020-10-19 20:24:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:01,575 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-19 20:24:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,594 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-19 20:24:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:01,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-19 20:24:01,596 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-19 20:24:01,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:01,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:01,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-19 20:24:01,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,598 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-19 20:24:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-19 20:24:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-19 20:24:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:24:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-19 20:24:01,601 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-19 20:24:01,602 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-19 20:24:01,602 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:24:01,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-19 20:24:01,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,604 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-19 20:24:01,604 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,604 INFO L794 eck$LassoCheckResult]: Stem: 430#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(10); 428#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 424#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 425#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 426#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 427#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 435#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 434#L34-3 assume !(main_~i~1 < 10); 423#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 413#L20-3 [2020-10-19 20:24:01,604 INFO L796 eck$LassoCheckResult]: Loop: 413#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 414#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 422#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 417#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 413#L20-3 [2020-10-19 20:24:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-19 20:24:01,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794715448] [2020-10-19 20:24:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794715448] [2020-10-19 20:24:01,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322422910] [2020-10-19 20:24:01,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:01,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 20:24:01,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:01,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:24:01,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216411396] [2020-10-19 20:24:01,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-19 20:24:01,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803303002] [2020-10-19 20:24:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:01,780 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-19 20:24:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,806 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-19 20:24:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:01,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-19 20:24:01,807 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-19 20:24:01,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:01,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:01,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-19 20:24:01,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,809 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-19 20:24:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-19 20:24:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-19 20:24:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:24:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-19 20:24:01,813 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-19 20:24:01,813 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-19 20:24:01,813 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:24:01,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-19 20:24:01,814 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:01,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,815 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-19 20:24:01,815 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,816 INFO L794 eck$LassoCheckResult]: Stem: 527#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(10); 522#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 523#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 524#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 525#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 526#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 528#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 535#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 534#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 533#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 532#L34-3 assume !(main_~i~1 < 10); 521#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 511#L20-3 [2020-10-19 20:24:01,816 INFO L796 eck$LassoCheckResult]: Loop: 511#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 512#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 520#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 515#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 511#L20-3 [2020-10-19 20:24:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-19 20:24:01,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759111673] [2020-10-19 20:24:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759111673] [2020-10-19 20:24:01,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025383843] [2020-10-19 20:24:01,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:01,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 20:24:01,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:01,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:24:01,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815643511] [2020-10-19 20:24:01,936 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-19 20:24:01,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754264284] [2020-10-19 20:24:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,948 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:01,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:24:01,988 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-19 20:24:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,015 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-10-19 20:24:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:24:02,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2020-10-19 20:24:02,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2020-10-19 20:24:02,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:02,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:02,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2020-10-19 20:24:02,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,018 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-19 20:24:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2020-10-19 20:24:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-10-19 20:24:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-19 20:24:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-19 20:24:02,022 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:24:02,022 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:24:02,022 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:24:02,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-19 20:24:02,023 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,024 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-19 20:24:02,024 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,024 INFO L794 eck$LassoCheckResult]: Stem: 636#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(10); 631#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 632#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 633#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 634#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 635#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 637#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 646#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 645#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 644#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 643#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 642#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 641#L34-3 assume !(main_~i~1 < 10); 630#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 620#L20-3 [2020-10-19 20:24:02,024 INFO L796 eck$LassoCheckResult]: Loop: 620#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 621#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 629#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 624#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 620#L20-3 [2020-10-19 20:24:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-19 20:24:02,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430737301] [2020-10-19 20:24:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430737301] [2020-10-19 20:24:02,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133169518] [2020-10-19 20:24:02,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:02,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 20:24:02,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:02,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:02,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-19 20:24:02,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056444369] [2020-10-19 20:24:02,173 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-19 20:24:02,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67006879] [2020-10-19 20:24:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:24:02,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:24:02,229 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-19 20:24:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,262 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-10-19 20:24:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:24:02,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-10-19 20:24:02,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2020-10-19 20:24:02,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:02,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:02,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2020-10-19 20:24:02,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,265 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-19 20:24:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2020-10-19 20:24:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-19 20:24:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:24:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-19 20:24:02,268 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-19 20:24:02,268 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-19 20:24:02,268 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:24:02,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-19 20:24:02,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,270 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-10-19 20:24:02,270 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,270 INFO L794 eck$LassoCheckResult]: Stem: 757#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(10); 755#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 751#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 752#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 753#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 754#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 756#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 768#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 767#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 766#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 765#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 764#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 763#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 762#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 761#L34-3 assume !(main_~i~1 < 10); 750#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 740#L20-3 [2020-10-19 20:24:02,270 INFO L796 eck$LassoCheckResult]: Loop: 740#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 741#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 749#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 744#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 740#L20-3 [2020-10-19 20:24:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-10-19 20:24:02,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782337098] [2020-10-19 20:24:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782337098] [2020-10-19 20:24:02,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634930384] [2020-10-19 20:24:02,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:02,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-19 20:24:02,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:02,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:02,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-19 20:24:02,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206844487] [2020-10-19 20:24:02,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2020-10-19 20:24:02,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603697891] [2020-10-19 20:24:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,487 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:24:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:24:02,535 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-19 20:24:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,580 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-10-19 20:24:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:24:02,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2020-10-19 20:24:02,583 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2020-10-19 20:24:02,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:02,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:02,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2020-10-19 20:24:02,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,585 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2020-10-19 20:24:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2020-10-19 20:24:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-10-19 20:24:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-19 20:24:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-10-19 20:24:02,592 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-19 20:24:02,592 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-19 20:24:02,592 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:24:02,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2020-10-19 20:24:02,596 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,597 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-10-19 20:24:02,597 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,597 INFO L794 eck$LassoCheckResult]: Stem: 888#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(10); 886#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 882#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 883#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 884#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 885#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 887#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 901#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 900#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 899#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 898#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 897#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 896#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 895#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 894#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 893#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 892#L34-3 assume !(main_~i~1 < 10); 881#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 871#L20-3 [2020-10-19 20:24:02,597 INFO L796 eck$LassoCheckResult]: Loop: 871#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 872#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 880#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 875#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 871#L20-3 [2020-10-19 20:24:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-10-19 20:24:02,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026381500] [2020-10-19 20:24:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026381500] [2020-10-19 20:24:02,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807172717] [2020-10-19 20:24:02,724 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:02,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:02,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-19 20:24:02,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380818771] [2020-10-19 20:24:02,809 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2020-10-19 20:24:02,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85893737] [2020-10-19 20:24:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 20:24:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-19 20:24:02,872 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-19 20:24:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,911 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-19 20:24:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:24:02,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2020-10-19 20:24:02,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2020-10-19 20:24:02,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:02,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:02,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2020-10-19 20:24:02,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,915 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2020-10-19 20:24:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2020-10-19 20:24:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-10-19 20:24:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-19 20:24:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-10-19 20:24:02,920 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-19 20:24:02,920 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-19 20:24:02,921 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:24:02,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-10-19 20:24:02,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:02,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,923 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-10-19 20:24:02,924 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,924 INFO L794 eck$LassoCheckResult]: Stem: 1029#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(10); 1024#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1025#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1026#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1027#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1028#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1030#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1045#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1043#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1042#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1041#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1040#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1039#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1038#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1037#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1036#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1035#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1034#L34-3 assume !(main_~i~1 < 10); 1023#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1013#L20-3 [2020-10-19 20:24:02,924 INFO L796 eck$LassoCheckResult]: Loop: 1013#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1014#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1022#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1017#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1013#L20-3 [2020-10-19 20:24:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-10-19 20:24:02,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932565617] [2020-10-19 20:24:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:03,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932565617] [2020-10-19 20:24:03,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404776907] [2020-10-19 20:24:03,051 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:03,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:03,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:24:03,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:03,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:03,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-19 20:24:03,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40876042] [2020-10-19 20:24:03,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2020-10-19 20:24:03,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111754496] [2020-10-19 20:24:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 20:24:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-19 20:24:03,208 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-10-19 20:24:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:03,249 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-10-19 20:24:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:24:03,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2020-10-19 20:24:03,251 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:03,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2020-10-19 20:24:03,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:03,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:03,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2020-10-19 20:24:03,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:03,253 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-10-19 20:24:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2020-10-19 20:24:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-10-19 20:24:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-19 20:24:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-19 20:24:03,259 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-19 20:24:03,259 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-19 20:24:03,259 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:24:03,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-10-19 20:24:03,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:03,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:03,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:03,262 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-10-19 20:24:03,262 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:03,263 INFO L794 eck$LassoCheckResult]: Stem: 1182#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(10); 1177#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1178#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1179#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1180#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1181#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1183#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1200#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1199#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1198#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1197#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1196#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1195#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1194#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1193#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1192#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1190#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1189#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1188#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1187#L34-3 assume !(main_~i~1 < 10); 1176#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1166#L20-3 [2020-10-19 20:24:03,263 INFO L796 eck$LassoCheckResult]: Loop: 1166#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1167#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1170#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1166#L20-3 [2020-10-19 20:24:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-10-19 20:24:03,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180485572] [2020-10-19 20:24:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:03,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180485572] [2020-10-19 20:24:03,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314542685] [2020-10-19 20:24:03,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:03,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-19 20:24:03,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:03,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 20:24:03,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:03,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:03,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-19 20:24:03,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322380485] [2020-10-19 20:24:03,529 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2020-10-19 20:24:03,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136140643] [2020-10-19 20:24:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:03,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:03,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:24:03,581 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-19 20:24:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:03,631 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-10-19 20:24:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 20:24:03,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2020-10-19 20:24:03,632 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:03,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2020-10-19 20:24:03,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:24:03,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:24:03,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2020-10-19 20:24:03,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:03,634 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-19 20:24:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2020-10-19 20:24:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-19 20:24:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-19 20:24:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-10-19 20:24:03,637 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-19 20:24:03,637 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-19 20:24:03,637 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:24:03,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-10-19 20:24:03,638 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:24:03,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:03,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:03,639 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-10-19 20:24:03,639 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:03,639 INFO L794 eck$LassoCheckResult]: Stem: 1345#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(10); 1340#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1341#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1342#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1343#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1344#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1346#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1365#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1364#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1363#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1362#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1361#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1360#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1359#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1358#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1357#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1356#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1355#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1354#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1353#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1352#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1351#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1350#L34-3 assume !(main_~i~1 < 10); 1339#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1329#L20-3 [2020-10-19 20:24:03,639 INFO L796 eck$LassoCheckResult]: Loop: 1329#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1330#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1338#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1333#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1329#L20-3 [2020-10-19 20:24:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-10-19 20:24:03,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234193621] [2020-10-19 20:24:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2020-10-19 20:24:03,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538179011] [2020-10-19 20:24:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2020-10-19 20:24:03,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869137922] [2020-10-19 20:24:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,765 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:08,914 WARN L193 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 251 DAG size of output: 181 [2020-10-19 20:24:09,446 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-19 20:24:09,452 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:09,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:09,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:09,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:09,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:09,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:09,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:09,453 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:09,453 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2020-10-19 20:24:09,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:09,453 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:09,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,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:09,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,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:09,490 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:09,494 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:09,497 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:09,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:09,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:09,505 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:09,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:09,510 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:09,513 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:09,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:09,517 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:09,821 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-19 20:24:09,855 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:09,865 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:09,867 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:09,871 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:09,877 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:09,881 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:09,883 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:09,885 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:09,889 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:10,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:10,263 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:24:10,275 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,279 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:10,310 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:10,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,315 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:10,340 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:10,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,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 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:10,373 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:10,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,380 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:10,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:10,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,409 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) [2020-10-19 20:24:10,434 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:10,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,440 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) [2020-10-19 20:24:10,476 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:10,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,482 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) [2020-10-19 20:24:10,520 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:10,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10,558 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:10,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10,586 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:10,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,590 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:10,616 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:10,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,622 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:10,646 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:10,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,652 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 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:10,676 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:10,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,679 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,702 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:10,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,712 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:10,748 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:10,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,753 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 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:10,789 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:10,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,800 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:10,833 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:10,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,840 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:10,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:10,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,867 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) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,893 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:10,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,899 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:10,924 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:10,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,938 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,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:10,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,968 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,993 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:10,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,999 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 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:11,028 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:11,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:11,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:11,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:11,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:11,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:11,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:11,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:11,076 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:24:11,076 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. 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:11,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:11,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:11,082 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:11,082 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2020-10-19 20:24:11,138 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 20:24:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:11,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:11,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:11,203 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:11,204 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:11,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 20:24:11,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2020-10-19 20:24:11,227 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:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-19 20:24:11,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2020-10-19 20:24:11,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:11,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2020-10-19 20:24:11,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:11,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2020-10-19 20:24:11,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:11,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2020-10-19 20:24:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2020-10-19 20:24:11,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 20:24:11,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 20:24:11,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2020-10-19 20:24:11,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:11,235 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-19 20:24:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2020-10-19 20:24:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-19 20:24:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-19 20:24:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2020-10-19 20:24:11,238 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-19 20:24:11,238 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-19 20:24:11,238 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:24:11,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2020-10-19 20:24:11,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:11,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:11,240 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:11,240 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:11,240 INFO L794 eck$LassoCheckResult]: Stem: 1590#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(10); 1585#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1586#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1587#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1588#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1589#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1591#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1610#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1609#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1608#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1607#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1606#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1605#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1604#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1603#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1602#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1601#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1600#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1599#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1598#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1597#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1596#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1595#L34-3 assume !(main_~i~1 < 10); 1584#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1573#L20-3 assume !(max_~i~0 < 10); 1569#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1570#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1594#L20-8 [2020-10-19 20:24:11,241 INFO L796 eck$LassoCheckResult]: Loop: 1594#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1579#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1571#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1572#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1594#L20-8 [2020-10-19 20:24:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2020-10-19 20:24:11,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879813356] [2020-10-19 20:24:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-19 20:24:11,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879813356] [2020-10-19 20:24:11,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:11,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:11,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155004468] [2020-10-19 20:24:11,281 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-19 20:24:11,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462554829] [2020-10-19 20:24:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:11,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:11,332 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:24:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:11,374 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-10-19 20:24:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:11,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2020-10-19 20:24:11,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2020-10-19 20:24:11,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 20:24:11,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 20:24:11,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2020-10-19 20:24:11,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:11,377 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-10-19 20:24:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2020-10-19 20:24:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-10-19 20:24:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-19 20:24:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-10-19 20:24:11,380 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-19 20:24:11,380 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-19 20:24:11,380 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:24:11,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2020-10-19 20:24:11,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:11,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:11,381 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:11,382 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:11,382 INFO L794 eck$LassoCheckResult]: Stem: 1695#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(10); 1690#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1691#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1692#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1693#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1694#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1716#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1715#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1714#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1713#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1712#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1711#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1710#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1709#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1708#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1707#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1706#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1705#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1704#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1703#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1702#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1701#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1700#L34-3 assume !(main_~i~1 < 10); 1689#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1678#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1679#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1688#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1683#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1680#L20-3 assume !(max_~i~0 < 10); 1674#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1675#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-10-19 20:24:11,382 INFO L796 eck$LassoCheckResult]: Loop: 1684#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1676#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1677#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1699#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-10-19 20:24:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2020-10-19 20:24:11,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737120207] [2020-10-19 20:24:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-19 20:24:11,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737120207] [2020-10-19 20:24:11,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960387441] [2020-10-19 20:24:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:24:11,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-19 20:24:11,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:11,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:24:11,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703378407] [2020-10-19 20:24:11,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-19 20:24:11,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450209409] [2020-10-19 20:24:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,493 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:11,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:24:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:24:11,579 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:24:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:11,650 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-10-19 20:24:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:11,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2020-10-19 20:24:11,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2020-10-19 20:24:11,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-19 20:24:11,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-19 20:24:11,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2020-10-19 20:24:11,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:11,653 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-10-19 20:24:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2020-10-19 20:24:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-10-19 20:24:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-19 20:24:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-10-19 20:24:11,657 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-19 20:24:11,657 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-19 20:24:11,657 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 20:24:11,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2020-10-19 20:24:11,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:11,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:11,659 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:11,659 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:11,660 INFO L794 eck$LassoCheckResult]: Stem: 1910#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(10); 1905#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1906#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1907#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1908#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1909#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1937#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1936#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1935#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1934#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1933#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1932#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1931#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1930#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1929#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1928#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1927#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1926#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1925#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1923#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1921#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1920#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1919#L34-3 assume !(main_~i~1 < 10); 1904#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1891#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1918#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1917#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1893#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1903#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1897#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1898#L20-3 assume !(max_~i~0 < 10); 1887#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1888#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1914#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1924#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1922#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-10-19 20:24:11,660 INFO L796 eck$LassoCheckResult]: Loop: 1899#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1889#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1890#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1916#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-10-19 20:24:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2020-10-19 20:24:11,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5703703] [2020-10-19 20:24:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-10-19 20:24:11,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5703703] [2020-10-19 20:24:11,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963901620] [2020-10-19 20:24:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:11,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:11,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-10-19 20:24:11,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:11,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:24:11,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547036234] [2020-10-19 20:24:11,795 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-19 20:24:11,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235948037] [2020-10-19 20:24:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:11,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:11,804 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:11,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:11,884 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-19 20:24:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:11,973 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2020-10-19 20:24:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:11,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2020-10-19 20:24:11,975 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2020-10-19 20:24:11,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-19 20:24:11,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-19 20:24:11,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2020-10-19 20:24:11,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:11,976 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-10-19 20:24:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2020-10-19 20:24:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2020-10-19 20:24:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-19 20:24:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-10-19 20:24:11,980 INFO L714 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-19 20:24:11,980 INFO L594 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-19 20:24:11,980 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-19 20:24:11,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2020-10-19 20:24:11,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:11,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:11,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:11,982 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:11,983 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:11,983 INFO L794 eck$LassoCheckResult]: Stem: 2169#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(10); 2164#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2165#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2166#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2167#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2168#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2170#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2197#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2196#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2195#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2194#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2193#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2192#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2191#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2190#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2189#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2188#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2187#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2186#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2185#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2184#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2182#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2181#L34-3 assume !(main_~i~1 < 10); 2163#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2149#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2150#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2203#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2202#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2151#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2152#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2162#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2155#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2156#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2177#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2183#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2176#L20-3 assume !(max_~i~0 < 10); 2145#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2146#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2157#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2158#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2175#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2201#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2147#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2148#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2200#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-10-19 20:24:11,983 INFO L796 eck$LassoCheckResult]: Loop: 2179#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2199#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2180#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2178#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-10-19 20:24:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2020-10-19 20:24:11,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:11,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561476908] [2020-10-19 20:24:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-10-19 20:24:12,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561476908] [2020-10-19 20:24:12,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122688441] [2020-10-19 20:24:12,113 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:12,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:12,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:12,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-10-19 20:24:12,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:12,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:24:12,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248709520] [2020-10-19 20:24:12,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-19 20:24:12,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:12,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957761984] [2020-10-19 20:24:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,219 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:12,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:12,289 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-19 20:24:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:12,399 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-10-19 20:24:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:12,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2020-10-19 20:24:12,401 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:12,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2020-10-19 20:24:12,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-19 20:24:12,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-19 20:24:12,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2020-10-19 20:24:12,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:12,403 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-10-19 20:24:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2020-10-19 20:24:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-10-19 20:24:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-19 20:24:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2020-10-19 20:24:12,407 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-19 20:24:12,408 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-19 20:24:12,408 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-19 20:24:12,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2020-10-19 20:24:12,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:12,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:12,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:12,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:12,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:12,410 INFO L794 eck$LassoCheckResult]: Stem: 2473#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(10); 2467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2468#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2469#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2470#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2471#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2474#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2500#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2499#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2498#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2497#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2496#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2495#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2494#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2493#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2492#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2491#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2490#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2489#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2488#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2487#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2485#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2484#L34-3 assume !(main_~i~1 < 10); 2466#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2452#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2453#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2472#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2514#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2454#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2455#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2465#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2458#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2459#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2513#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2512#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2511#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2509#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2480#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2502#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2486#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2479#L20-3 assume !(max_~i~0 < 10); 2448#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2449#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2478#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2510#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2450#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2451#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2477#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2460#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2461#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2508#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2507#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2506#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2505#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2504#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2503#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-10-19 20:24:12,410 INFO L796 eck$LassoCheckResult]: Loop: 2482#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2501#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2483#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2481#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-10-19 20:24:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2020-10-19 20:24:12,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:12,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096212986] [2020-10-19 20:24:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-19 20:24:12,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096212986] [2020-10-19 20:24:12,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208611167] [2020-10-19 20:24:12,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:12,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-19 20:24:12,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:12,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:12,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-19 20:24:12,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:12,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:24:12,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398969892] [2020-10-19 20:24:12,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-19 20:24:12,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:12,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685437028] [2020-10-19 20:24:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,595 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:12,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:24:12,666 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-19 20:24:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:12,790 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2020-10-19 20:24:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:24:12,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2020-10-19 20:24:12,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:12,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2020-10-19 20:24:12,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-10-19 20:24:12,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-10-19 20:24:12,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2020-10-19 20:24:12,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:12,795 INFO L691 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2020-10-19 20:24:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2020-10-19 20:24:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2020-10-19 20:24:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-19 20:24:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2020-10-19 20:24:12,798 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-19 20:24:12,798 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-19 20:24:12,798 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-19 20:24:12,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2020-10-19 20:24:12,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:12,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:12,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:12,800 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:12,800 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:12,800 INFO L794 eck$LassoCheckResult]: Stem: 2821#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(10); 2815#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2816#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2817#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2818#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2819#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2822#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2849#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2848#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2847#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2846#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2845#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2844#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2843#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2842#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2841#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2840#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2839#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2837#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2836#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2834#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2833#L34-3 assume !(main_~i~1 < 10); 2814#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2800#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2801#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2820#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2806#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2802#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2803#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2870#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2869#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2868#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2867#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2866#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2865#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2864#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2863#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2812#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2813#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2862#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2829#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2851#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2835#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2828#L20-3 assume !(max_~i~0 < 10); 2796#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2797#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2825#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2807#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2808#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2826#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2827#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2861#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2798#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2799#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2860#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2859#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2858#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2857#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2856#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2855#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2854#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2853#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2852#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-10-19 20:24:12,800 INFO L796 eck$LassoCheckResult]: Loop: 2831#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2850#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2832#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2830#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-10-19 20:24:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2020-10-19 20:24:12,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:12,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045989227] [2020-10-19 20:24:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-10-19 20:24:12,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045989227] [2020-10-19 20:24:12,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971151578] [2020-10-19 20:24:12,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:12,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 20:24:12,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:12,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:24:12,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-10-19 20:24:12,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:12,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-19 20:24:12,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339939188] [2020-10-19 20:24:12,982 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-19 20:24:12,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:12,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632468729] [2020-10-19 20:24:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:12,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:12,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:13,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:24:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:24:13,050 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2020-10-19 20:24:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:13,201 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2020-10-19 20:24:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:24:13,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2020-10-19 20:24:13,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:13,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2020-10-19 20:24:13,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-19 20:24:13,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-19 20:24:13,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2020-10-19 20:24:13,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:13,207 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2020-10-19 20:24:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2020-10-19 20:24:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2020-10-19 20:24:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-19 20:24:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2020-10-19 20:24:13,210 INFO L714 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-19 20:24:13,210 INFO L594 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-19 20:24:13,210 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-19 20:24:13,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2020-10-19 20:24:13,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:13,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:13,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:13,212 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:13,212 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:13,212 INFO L794 eck$LassoCheckResult]: Stem: 3214#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(10); 3208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3209#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3210#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3211#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3212#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3215#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3241#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3240#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3239#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3237#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3236#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3235#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3234#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3233#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3232#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3231#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3230#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3229#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3227#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3226#L34-3 assume !(main_~i~1 < 10); 3207#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3194#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3213#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3199#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3195#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3196#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3271#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3270#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3269#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3268#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3267#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3266#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3265#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3264#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3263#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3262#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3261#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3260#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3205#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3206#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3259#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3222#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3244#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3228#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3221#L20-3 assume !(max_~i~0 < 10); 3189#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3190#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3218#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3200#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3201#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3219#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3220#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3258#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3191#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3192#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3257#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3256#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3255#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3254#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3253#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3252#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3250#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3249#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3248#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3247#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3246#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3245#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-10-19 20:24:13,212 INFO L796 eck$LassoCheckResult]: Loop: 3224#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3225#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3223#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-10-19 20:24:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2020-10-19 20:24:13,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:13,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895943190] [2020-10-19 20:24:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-10-19 20:24:13,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895943190] [2020-10-19 20:24:13,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875512244] [2020-10-19 20:24:13,349 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:13,496 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-10-19 20:24:13,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:13,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:24:13,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-10-19 20:24:13,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:13,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-19 20:24:13,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120608185] [2020-10-19 20:24:13,532 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2020-10-19 20:24:13,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:13,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152744335] [2020-10-19 20:24:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:13,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:13,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:13,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:13,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:24:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:24:13,619 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2020-10-19 20:24:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:13,768 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2020-10-19 20:24:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:24:13,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2020-10-19 20:24:13,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:13,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2020-10-19 20:24:13,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-10-19 20:24:13,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-19 20:24:13,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2020-10-19 20:24:13,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:13,772 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-10-19 20:24:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2020-10-19 20:24:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2020-10-19 20:24:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-19 20:24:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2020-10-19 20:24:13,774 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-19 20:24:13,775 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-19 20:24:13,775 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-19 20:24:13,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2020-10-19 20:24:13,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:13,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:13,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:13,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:13,782 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:13,782 INFO L794 eck$LassoCheckResult]: Stem: 3651#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(10); 3646#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3647#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3648#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3649#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3650#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3652#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3675#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3674#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3673#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3672#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3671#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3670#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3669#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3668#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3667#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3666#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3664#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3663#L34-3 assume !(main_~i~1 < 10); 3645#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3631#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3632#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3643#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3644#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3633#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3634#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3717#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3638#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3639#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3716#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3715#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3714#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3713#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3712#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3711#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3710#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3709#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3708#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3707#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3706#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3705#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3704#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3703#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3702#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3699#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3659#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3681#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3665#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3658#L20-3 assume !(max_~i~0 < 10); 3629#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3630#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3656#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3701#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3700#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3657#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3655#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3637#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3627#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3628#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3697#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3696#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3695#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3694#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3693#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3692#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3691#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3690#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3689#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3688#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3687#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3686#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3685#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3684#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3683#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3682#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-10-19 20:24:13,782 INFO L796 eck$LassoCheckResult]: Loop: 3661#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3680#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3662#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3660#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-10-19 20:24:13,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2020-10-19 20:24:13,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:13,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526130507] [2020-10-19 20:24:13,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-10-19 20:24:13,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526130507] [2020-10-19 20:24:13,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113804460] [2020-10-19 20:24:13,908 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:14,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-10-19 20:24:14,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:14,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 20:24:14,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-10-19 20:24:14,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:14,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-19 20:24:14,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115484211] [2020-10-19 20:24:14,298 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2020-10-19 20:24:14,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:14,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782440206] [2020-10-19 20:24:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:14,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:14,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:14,306 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:14,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 20:24:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-19 20:24:14,366 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-10-19 20:24:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:14,560 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2020-10-19 20:24:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:24:14,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2020-10-19 20:24:14,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:14,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2020-10-19 20:24:14,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-10-19 20:24:14,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-10-19 20:24:14,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2020-10-19 20:24:14,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:14,565 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2020-10-19 20:24:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2020-10-19 20:24:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2020-10-19 20:24:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:24:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2020-10-19 20:24:14,567 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-19 20:24:14,568 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-19 20:24:14,568 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-19 20:24:14,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2020-10-19 20:24:14,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:14,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:14,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:14,569 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:14,569 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:14,570 INFO L794 eck$LassoCheckResult]: Stem: 4135#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(10); 4129#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4130#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4131#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4132#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4133#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4136#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4162#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4161#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4160#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4159#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4158#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4157#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4155#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4154#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4153#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4152#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4151#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4150#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4149#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4147#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4146#L34-3 assume !(main_~i~1 < 10); 4128#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4114#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4115#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4134#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4208#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4116#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4117#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4127#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4120#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4121#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4206#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4205#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4204#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4203#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4201#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4200#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4199#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4197#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4196#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4195#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4194#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4193#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4192#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4191#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4190#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4189#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4187#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4142#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4164#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4148#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4141#L20-3 assume !(max_~i~0 < 10); 4110#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4111#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4140#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4188#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4112#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4113#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4139#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4122#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4123#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4186#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4185#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4184#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4183#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4182#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4181#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4180#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4179#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4178#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4177#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4176#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4175#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4172#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4171#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4170#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4169#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4168#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4167#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4166#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4165#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-10-19 20:24:14,570 INFO L796 eck$LassoCheckResult]: Loop: 4144#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4163#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4145#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4143#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-10-19 20:24:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2020-10-19 20:24:14,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:14,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961733067] [2020-10-19 20:24:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-10-19 20:24:14,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961733067] [2020-10-19 20:24:14,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705249136] [2020-10-19 20:24:14,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:14,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:24:14,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-10-19 20:24:14,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:14,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-19 20:24:14,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721233309] [2020-10-19 20:24:14,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2020-10-19 20:24:14,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:14,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998334661] [2020-10-19 20:24:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:14,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:14,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:14,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:14,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 20:24:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-19 20:24:14,894 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2020-10-19 20:24:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:15,100 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2020-10-19 20:24:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:24:15,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2020-10-19 20:24:15,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:15,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2020-10-19 20:24:15,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-19 20:24:15,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-19 20:24:15,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2020-10-19 20:24:15,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:15,105 INFO L691 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2020-10-19 20:24:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2020-10-19 20:24:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2020-10-19 20:24:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-19 20:24:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2020-10-19 20:24:15,108 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-19 20:24:15,108 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-19 20:24:15,108 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-19 20:24:15,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2020-10-19 20:24:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:15,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:15,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:15,110 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:15,110 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:15,111 INFO L794 eck$LassoCheckResult]: Stem: 4662#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(10); 4657#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4658#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4659#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4660#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4661#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4663#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4689#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4688#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4687#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4686#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4685#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4684#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4683#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4682#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4681#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4680#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4674#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4673#L34-3 assume !(main_~i~1 < 10); 4656#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4642#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4643#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4744#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4648#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4644#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4645#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4654#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4655#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4743#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4742#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4741#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4740#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4739#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4738#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4737#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4736#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4735#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4734#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4733#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4732#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4731#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4730#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4729#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4728#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4727#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4726#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4725#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4724#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4723#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4722#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4721#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4720#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4719#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4669#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4691#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4675#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4668#L20-3 assume !(max_~i~0 < 10); 4638#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4639#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4667#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4718#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4640#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4641#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4666#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4649#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4650#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4717#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4716#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4715#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4714#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4713#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4712#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4711#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4710#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4709#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4708#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4707#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4706#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4705#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4704#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4703#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4702#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4701#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4700#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4699#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4698#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4697#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4696#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4695#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4694#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4693#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4692#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-10-19 20:24:15,111 INFO L796 eck$LassoCheckResult]: Loop: 4671#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4690#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4672#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4670#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-10-19 20:24:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2020-10-19 20:24:15,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:15,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872180482] [2020-10-19 20:24:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-10-19 20:24:15,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872180482] [2020-10-19 20:24:15,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990389663] [2020-10-19 20:24:15,263 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:15,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:15,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:15,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 20:24:15,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-10-19 20:24:15,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:15,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-19 20:24:15,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615391802] [2020-10-19 20:24:15,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2020-10-19 20:24:15,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:15,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37743656] [2020-10-19 20:24:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,398 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:15,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:24:15,463 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2020-10-19 20:24:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:15,678 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2020-10-19 20:24:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 20:24:15,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2020-10-19 20:24:15,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:15,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2020-10-19 20:24:15,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-10-19 20:24:15,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2020-10-19 20:24:15,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2020-10-19 20:24:15,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:15,682 INFO L691 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2020-10-19 20:24:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2020-10-19 20:24:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2020-10-19 20:24:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-19 20:24:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2020-10-19 20:24:15,685 INFO L714 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-19 20:24:15,685 INFO L594 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-19 20:24:15,685 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-19 20:24:15,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2020-10-19 20:24:15,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:15,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:15,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:15,687 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:15,687 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:15,687 INFO L794 eck$LassoCheckResult]: Stem: 5226#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(10); 5221#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5222#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5223#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5224#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5225#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5268#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5266#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5264#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5262#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5260#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5258#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5256#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5254#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5252#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5250#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5248#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5246#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5244#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5240#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5237#L34-3 assume !(main_~i~1 < 10); 5220#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5206#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5218#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5219#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5208#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5209#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5316#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5315#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5314#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5313#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5312#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5311#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5310#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5309#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5308#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5307#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5306#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5305#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5304#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5213#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5214#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5303#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5302#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5301#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5300#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5299#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5298#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5296#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5294#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5292#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5290#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5288#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5286#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5284#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5282#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5280#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5278#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5232#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5275#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5273#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5231#L20-3 assume !(max_~i~0 < 10); 5204#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5205#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5229#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5212#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5202#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5203#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5230#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5297#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5295#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5293#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5291#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5289#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5287#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5285#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5283#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5281#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5279#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5277#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5276#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5274#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5272#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5271#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5270#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5269#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5265#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5263#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5261#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5259#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5257#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5255#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5253#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5249#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5247#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5245#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5241#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5239#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-10-19 20:24:15,687 INFO L796 eck$LassoCheckResult]: Loop: 5234#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 5236#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5235#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5233#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-10-19 20:24:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:15,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2020-10-19 20:24:15,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:15,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547769626] [2020-10-19 20:24:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,869 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2020-10-19 20:24:15,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:15,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286277544] [2020-10-19 20:24:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:15,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:15,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2020-10-19 20:24:15,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:15,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400393830] [2020-10-19 20:24:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-10-19 20:24:16,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400393830] [2020-10-19 20:24:16,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570971297] [2020-10-19 20:24:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:16,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 20:24:16,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-10-19 20:24:16,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:24:16,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-10-19 20:24:16,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471411520] [2020-10-19 20:24:16,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:24:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-10-19 20:24:16,203 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 13 states. [2020-10-19 20:24:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:16,464 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2020-10-19 20:24:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-19 20:24:16,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2020-10-19 20:24:16,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:16,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2020-10-19 20:24:16,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-19 20:24:16,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-19 20:24:16,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2020-10-19 20:24:16,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:16,473 INFO L691 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-19 20:24:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2020-10-19 20:24:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-19 20:24:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-19 20:24:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-10-19 20:24:16,478 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-19 20:24:16,478 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-19 20:24:16,478 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-19 20:24:16,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2020-10-19 20:24:16,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:16,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:16,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:16,480 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:16,483 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:16,484 INFO L794 eck$LassoCheckResult]: Stem: 5829#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(10); 5824#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5825#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5827#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5828#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5879#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5876#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5873#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5870#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5867#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5864#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5861#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5858#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5855#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5852#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5849#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5846#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5843#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5840#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5836#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5835#L34-3 assume !(main_~i~1 < 10); 5823#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5815#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5816#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5822#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5818#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5922#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5921#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5920#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5918#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5916#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5914#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5912#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5910#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5908#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5906#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5904#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5902#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5900#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5898#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5896#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5894#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5890#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5888#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5886#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5883#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5881#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5878#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5875#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5872#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5869#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5866#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5863#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5860#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5857#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5854#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5851#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5848#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5845#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5842#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5834#L20-3 assume !(max_~i~0 < 10); 5811#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5812#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5832#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5819#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5813#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5814#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5833#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5919#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5917#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5911#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5909#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5907#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5905#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5903#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5901#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5899#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5897#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5895#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5893#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5891#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5889#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5887#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5885#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5884#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5882#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5880#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5877#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5874#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5871#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5868#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5865#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5862#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5859#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5856#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5853#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5850#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5847#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5844#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5841#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5839#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5837#L20-8 assume !(max_~i~0 < 10); 5830#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5831#L23-1 main_#t~ret12 := max_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 5820#L43-3 [2020-10-19 20:24:16,484 INFO L796 eck$LassoCheckResult]: Loop: 5820#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 5821#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 5820#L43-3 [2020-10-19 20:24:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2020-10-19 20:24:16,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:16,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995970491] [2020-10-19 20:24:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-19 20:24:16,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:16,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237086271] [2020-10-19 20:24:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2020-10-19 20:24:16,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:16,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133135815] [2020-10-19 20:24:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:16,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:16,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:42,230 WARN L193 SmtUtils]: Spent 25.32 s on a formula simplification. DAG size of input: 717 DAG size of output: 502 [2020-10-19 20:24:47,548 WARN L193 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 245 DAG size of output: 183 [2020-10-19 20:24:47,554 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:47,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:47,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:47,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:47,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:47,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:47,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:47,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:47,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2020-10-19 20:24:47,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:47,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:47,560 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:47,576 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:47,580 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:47,586 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:47,591 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:47,596 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:47,600 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:47,604 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:47,611 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:47,614 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:47,619 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:47,624 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:47,630 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:47,633 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:47,637 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:47,642 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:47,648 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:49,860 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2020-10-19 20:24:50,065 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-19 20:24:50,066 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:50,071 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:50,076 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:50,086 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:51,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:51,014 INFO L489 LassoAnalysis]: Using template 'affine'. 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:51,017 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:51,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,020 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) [2020-10-19 20:24:51,044 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:51,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,048 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:51,073 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:51,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,076 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:51,099 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:51,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,102 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:51,127 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:51,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,134 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:51,156 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:51,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,159 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) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,182 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:51,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,185 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) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,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:51,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,213 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:51,237 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:51,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,240 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:51,264 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:51,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,267 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) [2020-10-19 20:24:51,289 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,295 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:51,319 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:51,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,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 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:51,349 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:51,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,352 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,375 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:51,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,381 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,419 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:51,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,474 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:51,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,481 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,519 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:51,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,576 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:51,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,585 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,623 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:51,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,629 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:51,668 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:51,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,676 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:51,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,743 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:51,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,757 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 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,778 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:51,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,787 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,812 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:51,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:51,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:51,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:51,819 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,842 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:51,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,856 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 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,883 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:51,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,912 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:51,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,916 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 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,938 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:51,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,943 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 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:51,972 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:51,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:51,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:51,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:51,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:51,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:51,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:51,985 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,007 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:52,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:52,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:52,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:52,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:52,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:52,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:52,012 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 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,036 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:52,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:52,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:52,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:52,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:52,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:52,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:52,042 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 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,069 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:52,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:52,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:52,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:52,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:52,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:52,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:52,074 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 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,095 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:52,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:52,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:52,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:52,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:52,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:52,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:52,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:52,098 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 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,122 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:52,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:52,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:52,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:52,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:52,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:52,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:52,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:52,206 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-19 20:24:52,206 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:52,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:52,211 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:52,211 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:52,212 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2020-10-19 20:24:52,762 INFO L297 tatePredicateManager]: 86 out of 86 supporting invariants were superfluous and have been removed [2020-10-19 20:24:52,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:52,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:52,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:52,882 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:52,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:52,916 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:52,917 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:52,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-19 20:24:52,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. Second operand 3 states. Result 114 states and 136 transitions. Complement of second has 4 states. [2020-10-19 20:24:52,937 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:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-19 20:24:52,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2020-10-19 20:24:52,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:52,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2020-10-19 20:24:52,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:52,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2020-10-19 20:24:52,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:52,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2020-10-19 20:24:52,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:52,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2020-10-19 20:24:52,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:24:52,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:24:52,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:24:52,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:52,943 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:52,943 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:52,944 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:52,944 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-19 20:24:52,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:24:52,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:52,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:24:52,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:24:52 BoogieIcfgContainer [2020-10-19 20:24:52,952 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:24:52,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:24:52,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:24:52,953 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:24:52,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:58" (3/4) ... [2020-10-19 20:24:52,957 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:24:52,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:24:52,959 INFO L168 Benchmark]: Toolchain (without parser) took 55927.24 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 324.5 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:52,959 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:52,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:52,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.17 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:52,960 INFO L168 Benchmark]: Boogie Preprocessor took 33.40 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:52,961 INFO L168 Benchmark]: RCFGBuilder took 602.21 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:52,961 INFO L168 Benchmark]: BuchiAutomizer took 54873.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:52,962 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:52,963 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.17 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.40 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 602.21 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 54873.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. 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 - 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 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 19 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 17 * unknown-#length-unknown[x] and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 54.8s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 51.9s. Construction of modules took 1.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 280 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 117 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 638 SDtfs, 1144 SDslu, 1940 SDs, 0 SdLazy, 1117 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital408 mio100 ax100 hnf99 lsp96 ukn43 mio100 lsp43 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms 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...