./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-9a8b2e8 [2020-10-20 08:16:36,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:16:36,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:16:36,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:16:36,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:16:36,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:16:36,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:16:36,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:16:36,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:16:36,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:16:36,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:16:36,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:16:36,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:16:36,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:16:36,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:16:36,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:16:36,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:16:37,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:16:37,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:16:37,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:16:37,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:16:37,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:16:37,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:16:37,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:16:37,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:16:37,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:16:37,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:16:37,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:16:37,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:16:37,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:16:37,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:16:37,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:16:37,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:16:37,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:16:37,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:16:37,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:16:37,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:16:37,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:16:37,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:16:37,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:16:37,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:16:37,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:16:37,044 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:16:37,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:16:37,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:16:37,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:16:37,047 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:16:37,047 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:16:37,047 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:16:37,047 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:16:37,048 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:16:37,048 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:16:37,048 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:16:37,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:16:37,049 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:16:37,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:16:37,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:16:37,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:16:37,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:16:37,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:16:37,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:16:37,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:16:37,051 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:16:37,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:16:37,051 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:16:37,051 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:16:37,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:16:37,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:16:37,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:16:37,052 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:16:37,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:16:37,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:16:37,053 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:16:37,053 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:16:37,054 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:16:37,055 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-20 08:16:37,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:16:37,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:16:37,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:16:37,295 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:16:37,295 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:16:37,296 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-20 08:16:37,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7eb42c0/e188d2c3c4b248d6b0dbd9e1c8c8ccfb/FLAGa7d7313aa [2020-10-20 08:16:37,849 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:16:37,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2020-10-20 08:16:37,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7eb42c0/e188d2c3c4b248d6b0dbd9e1c8c8ccfb/FLAGa7d7313aa [2020-10-20 08:16:38,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7eb42c0/e188d2c3c4b248d6b0dbd9e1c8c8ccfb [2020-10-20 08:16:38,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:16:38,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:16:38,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:38,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:16:38,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:16:38,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214e0369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38, skipping insertion in model container [2020-10-20 08:16:38,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:16:38,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:16:38,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:38,642 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:16:38,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:38,683 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:16:38,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38 WrapperNode [2020-10-20 08:16:38,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:38,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:38,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:16:38,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:16:38,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:38,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:16:38,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:16:38,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:16:38,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (1/1) ... [2020-10-20 08:16:38,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:16:38,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:16:38,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:16:38,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:16:38,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (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-20 08:16:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:16:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:16:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:16:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:16:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:16:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:16:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:16:39,225 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:16:39,226 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-20 08:16:39,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:39 BoogieIcfgContainer [2020-10-20 08:16:39,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:16:39,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:16:39,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:16:39,236 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:16:39,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:39,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:16:38" (1/3) ... [2020-10-20 08:16:39,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370c8369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:39, skipping insertion in model container [2020-10-20 08:16:39,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:39,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:38" (2/3) ... [2020-10-20 08:16:39,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370c8369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:39, skipping insertion in model container [2020-10-20 08:16:39,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:39,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:39" (3/3) ... [2020-10-20 08:16:39,245 INFO L373 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2020-10-20 08:16:39,312 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:16:39,312 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:16:39,313 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:16:39,313 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:16:39,313 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:16:39,314 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:16:39,314 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:16:39,314 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:16:39,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-20 08:16:39,362 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-20 08:16:39,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:39,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:39,371 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:16:39,371 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:39,371 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:16:39,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-20 08:16:39,375 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-20 08:16:39,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:39,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:39,376 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:16:39,377 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:39,386 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-20 08:16:39,387 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-20 08:16:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:16:39,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:39,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719592701] [2020-10-20 08:16:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,554 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:39,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 08:16:39,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:39,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689446493] [2020-10-20 08:16:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 08:16:39,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:39,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375950188] [2020-10-20 08:16:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:39,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:39,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:39,908 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 08:16:40,025 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:40,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:40,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:40,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:40,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:40,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:40,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:40,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2020-10-20 08:16:40,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:40,029 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:40,054 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-20 08:16:40,061 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-20 08:16:40,064 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-20 08:16:40,068 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-20 08:16:40,073 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-20 08:16:40,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-20 08:16:40,080 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-20 08:16:40,083 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-20 08:16:40,087 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-20 08:16:40,090 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-20 08:16:40,094 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-20 08:16:40,098 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-20 08:16:40,101 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-20 08:16:40,104 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-20 08:16:40,107 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-20 08:16:40,110 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-20 08:16:40,113 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-20 08:16:40,301 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-20 08:16:40,305 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-20 08:16:40,609 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:40,615 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-20 08:16:40,631 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-20 08:16:40,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:40,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:40,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:40,710 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:40,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:40,716 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) [2020-10-20 08:16:40,760 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-20 08:16:40,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:40,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,767 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) [2020-10-20 08:16:40,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-20 08:16:40,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:40,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,831 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-20 08:16:40,875 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-20 08:16:40,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:40,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,880 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-20 08:16:40,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:40,929 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-20 08:16:40,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:40,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:40,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 08:16:40,974 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-20 08:16:40,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:40,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:40,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:40,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:40,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:40,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:40,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:40,980 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-20 08:16:41,010 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-20 08:16:41,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,074 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-20 08:16:41,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,116 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-20 08:16:41,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,137 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-20 08:16:41,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:41,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,192 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-20 08:16:41,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,204 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) [2020-10-20 08:16:41,247 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-20 08:16:41,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,253 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-20 08:16:41,281 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-20 08:16:41,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,286 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-20 08:16:41,344 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-20 08:16:41,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,364 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) [2020-10-20 08:16:41,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:41,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,413 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-20 08:16:41,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:41,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,467 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-20 08:16:41,514 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-20 08:16:41,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:41,527 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-20 08:16:41,552 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-20 08:16:41,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,608 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-20 08:16:41,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,642 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-20 08:16:41,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,680 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-20 08:16:41,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:16:41,738 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-20 08:16:41,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:41,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:41,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,746 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) [2020-10-20 08:16:41,803 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-20 08:16:41,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:41,813 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-20 08:16:41,847 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-20 08:16:41,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:41,862 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-20 08:16:41,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-20 08:16:41,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:41,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:41,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:41,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:41,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:41,905 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-20 08:16:41,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:42,100 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:16:42,101 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:42,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:42,128 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:42,128 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:42,129 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-20 08:16:42,176 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 08:16:42,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:16:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:42,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,237 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:42,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:42,271 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-20 08:16:42,288 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-20 08:16:42,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-20 08:16:42,402 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-20 08:16:42,403 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-20 08:16:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-20 08:16:42,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 08:16:42,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:42,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:16:42,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:42,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 08:16:42,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:42,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-20 08:16:42,417 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-20 08:16:42,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:16:42,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:42,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-20 08:16:42,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:42,425 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-20 08:16:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-20 08:16:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:16:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-20 08:16:42,477 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:42,477 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:16:42,477 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:16:42,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-20 08:16:42,479 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:42,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:42,480 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:16:42,480 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:42,481 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-20 08:16:42,481 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 08:16:42,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:42,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547282152] [2020-10-20 08:16:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,600 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-20 08:16:42,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547282152] [2020-10-20 08:16:42,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:42,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:16:42,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230104340] [2020-10-20 08:16:42,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-20 08:16:42,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:42,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369119446] [2020-10-20 08:16:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:42,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:42,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:42,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:42,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:42,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:16:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:16:42,701 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:16:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:42,722 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-20 08:16:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:16:42,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-20 08:16:42,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-20 08:16:42,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:42,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:42,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-20 08:16:42,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:42,728 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-20 08:16:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-20 08:16:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-20 08:16:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:16:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-20 08:16:42,731 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-20 08:16:42,731 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-20 08:16:42,732 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:16:42,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-20 08:16:42,733 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:42,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:42,734 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:16:42,734 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:42,734 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-20 08:16:42,734 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 08:16:42,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:42,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011069312] [2020-10-20 08:16:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,763 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-20 08:16:42,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011069312] [2020-10-20 08:16:42,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902661331] [2020-10-20 08:16:42,763 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-20 08:16:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:16:42,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:42,814 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-20 08:16:42,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:42,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:16:42,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408148063] [2020-10-20 08:16:42,815 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-20 08:16:42,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:42,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899517726] [2020-10-20 08:16:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:42,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:42,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:42,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:42,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:16:42,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:16:42,879 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 08:16:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:42,908 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-20 08:16:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:16:42,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-20 08:16:42,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-20 08:16:42,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:42,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:42,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-20 08:16:42,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:42,912 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-20 08:16:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-20 08:16:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-20 08:16:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:16:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 08:16:42,915 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 08:16:42,915 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 08:16:42,916 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:16:42,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-20 08:16:42,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:42,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:42,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:42,917 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 08:16:42,918 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:42,918 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-20 08:16:42,918 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 08:16:42,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:42,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675911405] [2020-10-20 08:16:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:42,957 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-20 08:16:42,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675911405] [2020-10-20 08:16:42,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116530754] [2020-10-20 08:16:42,958 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-20 08:16:42,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:42,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:42,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:42,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:43,011 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-20 08:16:43,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:43,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:16:43,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369796111] [2020-10-20 08:16:43,013 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-20 08:16:43,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781209349] [2020-10-20 08:16:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,025 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:43,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:16:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:16:43,074 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-20 08:16:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:43,104 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-20 08:16:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:16:43,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-20 08:16:43,107 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-20 08:16:43,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:43,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:43,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-20 08:16:43,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:43,108 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-20 08:16:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-20 08:16:43,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-20 08:16:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:16:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-20 08:16:43,112 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 08:16:43,112 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 08:16:43,112 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:16:43,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-20 08:16:43,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:43,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:43,114 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-20 08:16:43,114 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:43,115 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-20 08:16:43,115 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-20 08:16:43,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356452353] [2020-10-20 08:16:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:43,166 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-20 08:16:43,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356452353] [2020-10-20 08:16:43,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641683661] [2020-10-20 08:16:43,167 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-20 08:16:43,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 08:16:43,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:43,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:16:43,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:43,234 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-20 08:16:43,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:43,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:16:43,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917016790] [2020-10-20 08:16:43,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-20 08:16:43,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216762101] [2020-10-20 08:16:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,249 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:43,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:16:43,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:16:43,293 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-20 08:16:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:43,334 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-20 08:16:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:16:43,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-20 08:16:43,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-20 08:16:43,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:43,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:43,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-20 08:16:43,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:43,338 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-20 08:16:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-20 08:16:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-20 08:16:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:16:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-20 08:16:43,340 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-20 08:16:43,341 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-20 08:16:43,341 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:16:43,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-20 08:16:43,341 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:43,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:43,342 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-20 08:16:43,342 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:43,342 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-20 08:16:43,343 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-20 08:16:43,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149343049] [2020-10-20 08:16:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:43,423 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-20 08:16:43,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149343049] [2020-10-20 08:16:43,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689566604] [2020-10-20 08:16:43,424 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-20 08:16:43,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:16:43,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:43,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:43,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:43,496 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-20 08:16:43,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:43,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:16:43,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137079520] [2020-10-20 08:16:43,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-20 08:16:43,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534763987] [2020-10-20 08:16:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,504 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:43,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:16:43,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:16:43,545 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 08:16:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:43,577 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-10-20 08:16:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:16:43,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2020-10-20 08:16:43,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2020-10-20 08:16:43,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:43,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:43,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2020-10-20 08:16:43,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:43,580 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-20 08:16:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2020-10-20 08:16:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-10-20 08:16:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-20 08:16:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-20 08:16:43,584 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-20 08:16:43,584 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-20 08:16:43,584 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:16:43,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-20 08:16:43,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:43,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:43,586 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-20 08:16:43,586 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:43,586 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-20 08:16:43,587 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-20 08:16:43,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400398404] [2020-10-20 08:16:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:43,661 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-20 08:16:43,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400398404] [2020-10-20 08:16:43,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908047060] [2020-10-20 08:16:43,662 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-20 08:16:43,709 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 08:16:43,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:43,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:16:43,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:43,736 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-20 08:16:43,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:43,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 08:16:43,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077337436] [2020-10-20 08:16:43,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-20 08:16:43,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480111051] [2020-10-20 08:16:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:43,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:43,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:43,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:16:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:16:43,791 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-20 08:16:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:43,823 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-10-20 08:16:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 08:16:43,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-10-20 08:16:43,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2020-10-20 08:16:43,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:43,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:43,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2020-10-20 08:16:43,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:43,826 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-20 08:16:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2020-10-20 08:16:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-20 08:16:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 08:16:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-20 08:16:43,830 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-20 08:16:43,830 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-20 08:16:43,830 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:16:43,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-20 08:16:43,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:43,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:43,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:43,832 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-10-20 08:16:43,832 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:43,833 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-20 08:16:43,833 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-10-20 08:16:43,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:43,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417870537] [2020-10-20 08:16:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:43,939 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-20 08:16:43,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417870537] [2020-10-20 08:16:43,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475491105] [2020-10-20 08:16:43,941 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-20 08:16:44,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 08:16:44,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:44,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,030 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-20 08:16:44,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:44,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 08:16:44,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236996367] [2020-10-20 08:16:44,031 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2020-10-20 08:16:44,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189153925] [2020-10-20 08:16:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:44,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:44,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 08:16:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 08:16:44,081 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-20 08:16:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:44,115 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-10-20 08:16:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:16:44,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2020-10-20 08:16:44,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2020-10-20 08:16:44,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:44,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:44,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2020-10-20 08:16:44,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:44,118 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2020-10-20 08:16:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2020-10-20 08:16:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-10-20 08:16:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 08:16:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-10-20 08:16:44,122 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-20 08:16:44,122 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-20 08:16:44,122 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:16:44,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2020-10-20 08:16:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:44,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:44,124 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-10-20 08:16:44,124 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:44,125 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-20 08:16:44,125 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-10-20 08:16:44,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200131404] [2020-10-20 08:16:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,224 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-20 08:16:44,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200131404] [2020-10-20 08:16:44,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439782836] [2020-10-20 08:16:44,225 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-20 08:16:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,298 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-20 08:16:44,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:44,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 08:16:44,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321177925] [2020-10-20 08:16:44,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2020-10-20 08:16:44,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401258675] [2020-10-20 08:16:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,310 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:44,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:44,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 08:16:44,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 08:16:44,352 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-20 08:16:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:44,389 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-20 08:16:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:16:44,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2020-10-20 08:16:44,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2020-10-20 08:16:44,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:44,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:44,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2020-10-20 08:16:44,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:44,392 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2020-10-20 08:16:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2020-10-20 08:16:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-10-20 08:16:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 08:16:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-10-20 08:16:44,395 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-20 08:16:44,395 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-20 08:16:44,395 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:16:44,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-10-20 08:16:44,396 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:44,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:44,397 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-10-20 08:16:44,397 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:44,397 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-20 08:16:44,397 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-10-20 08:16:44,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577523732] [2020-10-20 08:16:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,498 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-20 08:16:44,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577523732] [2020-10-20 08:16:44,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589408823] [2020-10-20 08:16:44,498 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-20 08:16:44,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:44,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:44,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,571 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-20 08:16:44,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:44,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 08:16:44,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290953662] [2020-10-20 08:16:44,572 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2020-10-20 08:16:44,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543749439] [2020-10-20 08:16:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:44,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:16:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:16:44,619 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-10-20 08:16:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:44,657 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-10-20 08:16:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 08:16:44,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2020-10-20 08:16:44,659 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2020-10-20 08:16:44,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:44,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:44,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2020-10-20 08:16:44,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:44,661 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-10-20 08:16:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2020-10-20 08:16:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-10-20 08:16:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 08:16:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-20 08:16:44,664 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-20 08:16:44,665 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-20 08:16:44,665 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:16:44,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-10-20 08:16:44,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:44,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:44,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:44,667 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-10-20 08:16:44,667 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:44,667 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-20 08:16:44,667 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-10-20 08:16:44,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900379645] [2020-10-20 08:16:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:44,765 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-20 08:16:44,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900379645] [2020-10-20 08:16:44,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441575511] [2020-10-20 08:16:44,766 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-20 08:16:44,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-20 08:16:44,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:44,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 08:16:44,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:44,887 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-20 08:16:44,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:44,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-20 08:16:44,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491060956] [2020-10-20 08:16:44,888 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2020-10-20 08:16:44,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:44,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371772652] [2020-10-20 08:16:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:44,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:44,900 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:44,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:16:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 08:16:44,947 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-20 08:16:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:45,005 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-10-20 08:16:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 08:16:45,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2020-10-20 08:16:45,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:45,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2020-10-20 08:16:45,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 08:16:45,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 08:16:45,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2020-10-20 08:16:45,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:45,008 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-20 08:16:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2020-10-20 08:16:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-20 08:16:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 08:16:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-10-20 08:16:45,011 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-20 08:16:45,011 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-20 08:16:45,011 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:16:45,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-10-20 08:16:45,012 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 08:16:45,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:45,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:45,013 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-10-20 08:16:45,013 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:45,013 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-20 08:16:45,013 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-10-20 08:16:45,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478568758] [2020-10-20 08:16:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,046 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2020-10-20 08:16:45,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781496203] [2020-10-20 08:16:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2020-10-20 08:16:45,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:45,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092697245] [2020-10-20 08:16:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:45,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:45,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:50,440 WARN L193 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 251 DAG size of output: 181 [2020-10-20 08:16:50,957 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-20 08:16:50,959 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:50,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:50,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:50,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:50,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:50,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:50,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:50,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:50,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2020-10-20 08:16:50,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:50,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:50,967 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-20 08:16:50,978 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-20 08:16:50,987 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-20 08:16:50,992 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-20 08:16:50,994 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-20 08:16:50,997 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-20 08:16:51,000 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-20 08:16:51,002 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-20 08:16:51,005 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-20 08:16:51,008 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-20 08:16:51,011 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-20 08:16:51,014 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-20 08:16:51,017 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-20 08:16:51,020 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-20 08:16:51,022 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-20 08:16:51,025 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-20 08:16:51,354 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-20 08:16:51,395 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-20 08:16:51,398 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-20 08:16:51,400 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-20 08:16:51,403 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-20 08:16:51,406 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-20 08:16:51,408 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-20 08:16:51,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:51,414 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-20 08:16:51,417 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-20 08:16:51,786 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:16:51,787 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:51,805 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-20 08:16:51,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,809 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-20 08:16:51,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-20 08:16:51,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,836 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-20 08:16:51,864 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-20 08:16:51,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,868 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-20 08:16:51,895 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-20 08:16:51,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:51,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:51,902 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-20 08:16:51,925 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-20 08:16:51,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:51,952 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-20 08:16:51,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:51,978 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-20 08:16:51,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:51,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:51,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:51,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:51,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:51,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:51,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:51,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:52,019 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-20 08:16:52,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:52,051 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-20 08:16:52,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,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 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-20 08:16:52,078 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-20 08:16:52,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,081 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-20 08:16:52,106 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-20 08:16:52,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,113 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-20 08:16:52,145 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-20 08:16:52,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,148 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-20 08:16:52,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-20 08:16:52,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,177 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-20 08:16:52,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:16:52,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,205 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:52,233 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-20 08:16:52,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,237 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-20 08:16:52,260 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-20 08:16:52,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,277 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) [2020-10-20 08:16:52,300 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:52,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,306 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-20 08:16:52,330 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-20 08:16:52,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:16:52,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:16:52,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:16:52,334 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-20 08:16:52,361 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-20 08:16:52,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,367 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-20 08:16:52,391 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-20 08:16:52,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,402 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-20 08:16:52,426 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-20 08:16:52,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,433 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-20 08:16:52,456 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-20 08:16:52,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,466 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-20 08:16:52,491 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-20 08:16:52,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:16:52,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:16:52,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:16:52,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:16:52,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:16:52,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:16:52,508 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:16:52,529 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:16:52,529 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-20 08:16:52,533 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:16:52,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:16:52,536 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:16:52,536 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-20 08:16:52,590 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:16:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:52,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:16:52,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:52,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:52,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:52,677 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-20 08:16:52,678 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-20 08:16:52,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 08:16:52,704 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-20 08:16:52,706 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-20 08:16:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:16:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-20 08:16:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2020-10-20 08:16:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2020-10-20 08:16:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2020-10-20 08:16:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:16:52,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2020-10-20 08:16:52,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:52,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2020-10-20 08:16:52,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 08:16:52,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:16:52,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2020-10-20 08:16:52,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:52,712 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-20 08:16:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2020-10-20 08:16:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-20 08:16:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 08:16:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2020-10-20 08:16:52,720 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-20 08:16:52,720 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-20 08:16:52,720 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:16:52,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2020-10-20 08:16:52,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:52,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:52,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:52,722 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:52,722 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:52,723 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-20 08:16:52,723 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2020-10-20 08:16:52,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124885396] [2020-10-20 08:16:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:52,790 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-20 08:16:52,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124885396] [2020-10-20 08:16:52,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:16:52,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:16:52,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105090544] [2020-10-20 08:16:52,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-20 08:16:52,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246852837] [2020-10-20 08:16:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:52,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:52,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:52,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:16:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:16:52,842 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:16:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:52,892 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-10-20 08:16:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:16:52,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2020-10-20 08:16:52,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:52,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2020-10-20 08:16:52,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 08:16:52,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 08:16:52,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2020-10-20 08:16:52,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:52,895 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-10-20 08:16:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2020-10-20 08:16:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-10-20 08:16:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 08:16:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-10-20 08:16:52,901 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-20 08:16:52,901 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-20 08:16:52,901 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:16:52,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2020-10-20 08:16:52,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:52,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:52,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:52,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:16:52,904 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:52,905 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:52,905 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:52,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2020-10-20 08:16:52,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:52,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539983817] [2020-10-20 08:16:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:52,957 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-20 08:16:52,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539983817] [2020-10-20 08:16:52,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345992277] [2020-10-20 08:16:52,958 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-20 08:16:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:16:53,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:53,058 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-20 08:16:53,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:53,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:16:53,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031531840] [2020-10-20 08:16:53,059 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-20 08:16:53,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436924951] [2020-10-20 08:16:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:53,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:16:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:16:53,139 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 08:16:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:53,200 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-10-20 08:16:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:16:53,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2020-10-20 08:16:53,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2020-10-20 08:16:53,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-20 08:16:53,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-20 08:16:53,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2020-10-20 08:16:53,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:53,204 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-10-20 08:16:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2020-10-20 08:16:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-10-20 08:16:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 08:16:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-10-20 08:16:53,212 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-20 08:16:53,212 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-20 08:16:53,212 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:16:53,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2020-10-20 08:16:53,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:53,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:53,214 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-20 08:16:53,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:53,215 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,215 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2020-10-20 08:16:53,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972843369] [2020-10-20 08:16:53,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,260 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-20 08:16:53,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972843369] [2020-10-20 08:16:53,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023384845] [2020-10-20 08:16:53,261 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-20 08:16:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:16:53,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:53,330 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-20 08:16:53,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:53,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:16:53,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296412261] [2020-10-20 08:16:53,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-20 08:16:53,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759363128] [2020-10-20 08:16:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:53,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:16:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:16:53,416 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-20 08:16:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:53,500 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2020-10-20 08:16:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:16:53,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2020-10-20 08:16:53,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2020-10-20 08:16:53,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-20 08:16:53,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 08:16:53,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2020-10-20 08:16:53,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:53,503 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-10-20 08:16:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2020-10-20 08:16:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2020-10-20 08:16:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-20 08:16:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-10-20 08:16:53,514 INFO L714 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-20 08:16:53,514 INFO L594 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-20 08:16:53,514 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 08:16:53,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2020-10-20 08:16:53,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:53,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:53,516 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-20 08:16:53,519 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:53,519 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,519 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2020-10-20 08:16:53,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26753704] [2020-10-20 08:16:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,572 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-20 08:16:53,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26753704] [2020-10-20 08:16:53,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632404094] [2020-10-20 08:16:53,573 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-20 08:16:53,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:53,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:53,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:16:53,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:53,651 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-20 08:16:53,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:53,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:16:53,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580819060] [2020-10-20 08:16:53,652 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-20 08:16:53,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054644377] [2020-10-20 08:16:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:53,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:53,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:53,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:16:53,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:16:53,736 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-20 08:16:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:53,855 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-10-20 08:16:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:16:53,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2020-10-20 08:16:53,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2020-10-20 08:16:53,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-20 08:16:53,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-20 08:16:53,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2020-10-20 08:16:53,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:53,859 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-10-20 08:16:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2020-10-20 08:16:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-10-20 08:16:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 08:16:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2020-10-20 08:16:53,862 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-20 08:16:53,862 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-20 08:16:53,863 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 08:16:53,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2020-10-20 08:16:53,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:53,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:53,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:53,865 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-20 08:16:53,865 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:53,865 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,866 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2020-10-20 08:16:53,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:53,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644651502] [2020-10-20 08:16:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:53,928 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-20 08:16:53,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644651502] [2020-10-20 08:16:53,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316305753] [2020-10-20 08:16:53,929 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-20 08:16:54,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 08:16:54,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:54,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:16:54,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:54,038 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-20 08:16:54,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:54,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:16:54,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288276402] [2020-10-20 08:16:54,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-20 08:16:54,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231361644] [2020-10-20 08:16:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:54,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:16:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:16:54,149 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-20 08:16:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:54,277 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2020-10-20 08:16:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:16:54,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2020-10-20 08:16:54,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:54,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2020-10-20 08:16:54,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-10-20 08:16:54,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-10-20 08:16:54,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2020-10-20 08:16:54,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:54,282 INFO L691 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2020-10-20 08:16:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2020-10-20 08:16:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2020-10-20 08:16:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 08:16:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2020-10-20 08:16:54,286 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-20 08:16:54,286 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-20 08:16:54,286 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 08:16:54,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2020-10-20 08:16:54,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:54,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:54,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:54,288 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-20 08:16:54,289 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:54,289 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:54,289 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2020-10-20 08:16:54,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096436471] [2020-10-20 08:16:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:54,378 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-20 08:16:54,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096436471] [2020-10-20 08:16:54,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133005270] [2020-10-20 08:16:54,380 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-20 08:16:54,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:16:54,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:54,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:16:54,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:54,706 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-20 08:16:54,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:54,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 08:16:54,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128537810] [2020-10-20 08:16:54,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-20 08:16:54,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929821909] [2020-10-20 08:16:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:54,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:54,714 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:54,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:16:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:16:54,778 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2020-10-20 08:16:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:54,922 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2020-10-20 08:16:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 08:16:54,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2020-10-20 08:16:54,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:54,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2020-10-20 08:16:54,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-20 08:16:54,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-20 08:16:54,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2020-10-20 08:16:54,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:54,928 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2020-10-20 08:16:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2020-10-20 08:16:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2020-10-20 08:16:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-20 08:16:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2020-10-20 08:16:54,932 INFO L714 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-20 08:16:54,932 INFO L594 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-20 08:16:54,933 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 08:16:54,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2020-10-20 08:16:54,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:54,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:54,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:54,935 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-20 08:16:54,936 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:54,936 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:54,937 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:54,940 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2020-10-20 08:16:54,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:54,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631618159] [2020-10-20 08:16:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:55,073 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-20 08:16:55,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631618159] [2020-10-20 08:16:55,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777027038] [2020-10-20 08:16:55,074 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-20 08:16:55,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-10-20 08:16:55,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:55,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:16:55,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:55,231 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-20 08:16:55,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:55,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 08:16:55,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487919501] [2020-10-20 08:16:55,232 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2020-10-20 08:16:55,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:55,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477571002] [2020-10-20 08:16:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:55,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:55,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:55,251 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:55,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 08:16:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 08:16:55,320 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2020-10-20 08:16:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:55,499 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2020-10-20 08:16:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:16:55,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2020-10-20 08:16:55,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:55,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2020-10-20 08:16:55,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-10-20 08:16:55,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-20 08:16:55,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2020-10-20 08:16:55,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:55,504 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-10-20 08:16:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2020-10-20 08:16:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2020-10-20 08:16:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 08:16:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2020-10-20 08:16:55,507 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-20 08:16:55,507 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-20 08:16:55,507 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 08:16:55,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2020-10-20 08:16:55,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:55,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:55,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:55,509 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-20 08:16:55,509 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:55,510 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:55,510 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2020-10-20 08:16:55,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:55,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92469656] [2020-10-20 08:16:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:55,610 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-20 08:16:55,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92469656] [2020-10-20 08:16:55,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332478243] [2020-10-20 08:16:55,611 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-20 08:16:55,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-10-20 08:16:55,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:55,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 08:16:55,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:56,006 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-20 08:16:56,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:56,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 08:16:56,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890857784] [2020-10-20 08:16:56,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2020-10-20 08:16:56,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:56,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610095557] [2020-10-20 08:16:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:56,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:56,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:56,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:56,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 08:16:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 08:16:56,081 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-10-20 08:16:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:56,251 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2020-10-20 08:16:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:16:56,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2020-10-20 08:16:56,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:56,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2020-10-20 08:16:56,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-10-20 08:16:56,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-10-20 08:16:56,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2020-10-20 08:16:56,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:56,257 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2020-10-20 08:16:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2020-10-20 08:16:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2020-10-20 08:16:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:16:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2020-10-20 08:16:56,260 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-20 08:16:56,260 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-20 08:16:56,260 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 08:16:56,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2020-10-20 08:16:56,261 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:56,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:56,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:56,272 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-20 08:16:56,272 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:56,272 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:56,272 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2020-10-20 08:16:56,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:56,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116423699] [2020-10-20 08:16:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:56,385 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-20 08:16:56,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116423699] [2020-10-20 08:16:56,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477332653] [2020-10-20 08:16:56,386 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-20 08:16:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:56,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:16:56,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:56,510 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-20 08:16:56,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:56,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 08:16:56,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962444244] [2020-10-20 08:16:56,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2020-10-20 08:16:56,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:56,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26180625] [2020-10-20 08:16:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:56,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:56,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:56,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:56,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:16:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:16:56,605 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2020-10-20 08:16:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:56,807 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2020-10-20 08:16:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 08:16:56,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2020-10-20 08:16:56,809 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:56,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2020-10-20 08:16:56,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-20 08:16:56,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-20 08:16:56,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2020-10-20 08:16:56,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:56,812 INFO L691 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2020-10-20 08:16:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2020-10-20 08:16:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2020-10-20 08:16:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 08:16:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2020-10-20 08:16:56,815 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-20 08:16:56,815 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-20 08:16:56,815 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 08:16:56,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2020-10-20 08:16:56,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:56,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:56,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:56,817 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-20 08:16:56,817 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:56,817 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:56,817 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2020-10-20 08:16:56,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:56,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494448536] [2020-10-20 08:16:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:56,935 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-20 08:16:56,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494448536] [2020-10-20 08:16:56,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197170040] [2020-10-20 08:16:56,936 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-20 08:16:57,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:16:57,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:16:57,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 08:16:57,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:57,064 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-20 08:16:57,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:16:57,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-20 08:16:57,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004832112] [2020-10-20 08:16:57,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:16:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2020-10-20 08:16:57,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:57,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110962971] [2020-10-20 08:16:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,075 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:57,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:16:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 08:16:57,141 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2020-10-20 08:16:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:57,359 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2020-10-20 08:16:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 08:16:57,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2020-10-20 08:16:57,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:57,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2020-10-20 08:16:57,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-10-20 08:16:57,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2020-10-20 08:16:57,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2020-10-20 08:16:57,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:57,364 INFO L691 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2020-10-20 08:16:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2020-10-20 08:16:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2020-10-20 08:16:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-20 08:16:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2020-10-20 08:16:57,367 INFO L714 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-20 08:16:57,367 INFO L594 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-20 08:16:57,367 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 08:16:57,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2020-10-20 08:16:57,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 08:16:57,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:57,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:57,369 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-20 08:16:57,370 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:16:57,370 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:57,370 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2020-10-20 08:16:57,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:57,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577455832] [2020-10-20 08:16:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2020-10-20 08:16:57,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:57,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596111455] [2020-10-20 08:16:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:57,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:57,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2020-10-20 08:16:57,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:57,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516539900] [2020-10-20 08:16:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:57,843 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-20 08:16:57,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516539900] [2020-10-20 08:16:57,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241662153] [2020-10-20 08:16:57,844 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-20 08:16:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:16:57,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 08:16:57,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:16:57,985 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-20 08:16:57,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 08:16:57,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-10-20 08:16:57,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057004586] [2020-10-20 08:16:58,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:16:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:16:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-10-20 08:16:58,061 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 13 states. [2020-10-20 08:16:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:16:58,330 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2020-10-20 08:16:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 08:16:58,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2020-10-20 08:16:58,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:16:58,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2020-10-20 08:16:58,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-20 08:16:58,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-20 08:16:58,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2020-10-20 08:16:58,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:16:58,335 INFO L691 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-20 08:16:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2020-10-20 08:16:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-20 08:16:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 08:16:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-10-20 08:16:58,337 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-20 08:16:58,338 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-20 08:16:58,338 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-20 08:16:58,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2020-10-20 08:16:58,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:16:58,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:58,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:58,340 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-20 08:16:58,341 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:16:58,341 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 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-20 08:16:58,342 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-20 08:16:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2020-10-20 08:16:58,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427759101] [2020-10-20 08:16:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,511 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-20 08:16:58,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506451469] [2020-10-20 08:16:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2020-10-20 08:16:58,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741833389] [2020-10-20 08:16:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:24,890 WARN L193 SmtUtils]: Spent 26.15 s on a formula simplification. DAG size of input: 717 DAG size of output: 502 [2020-10-20 08:17:30,394 WARN L193 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 245 DAG size of output: 183 [2020-10-20 08:17:30,405 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:30,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:30,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:30,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:30,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:30,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:30,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:30,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:30,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2020-10-20 08:17:30,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:30,406 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:30,412 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-20 08:17:30,425 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-20 08:17:30,430 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-20 08:17:30,439 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-20 08:17:30,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,453 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-20 08:17:30,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,477 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-20 08:17:30,484 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-20 08:17:30,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:30,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-20 08:17:30,501 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-20 08:17:30,506 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-20 08:17:32,864 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2020-10-20 08:17:33,078 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-20 08:17:33,079 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-20 08:17:33,084 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-20 08:17:33,088 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-20 08:17:33,097 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-20 08:17:34,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:34,071 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-20 08:17:34,075 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-20 08:17:34,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,079 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-20 08:17:34,103 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-20 08:17:34,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,106 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-20 08:17:34,108 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-20 08:17:34,133 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-20 08:17:34,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,136 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-20 08:17:34,160 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-20 08:17:34,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,164 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-20 08:17:34,188 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-20 08:17:34,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,193 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-20 08:17:34,216 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-20 08:17:34,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 08:17:34,245 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-20 08:17:34,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,248 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-20 08:17:34,273 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-20 08:17:34,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,276 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-20 08:17:34,300 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-20 08:17:34,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,303 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-20 08:17:34,328 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-20 08:17:34,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,356 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-20 08:17:34,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,362 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-20 08:17:34,385 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-20 08:17:34,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,392 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-20 08:17:34,414 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-20 08:17:34,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,427 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-20 08:17:34,466 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-20 08:17:34,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,469 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-20 08:17:34,470 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-20 08:17:34,514 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-20 08:17:34,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,519 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-20 08:17:34,525 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-20 08:17:34,566 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-20 08:17:34,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,569 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-20 08:17:34,571 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-20 08:17:34,617 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-20 08:17:34,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,625 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-20 08:17:34,664 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-20 08:17:34,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,668 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-20 08:17:34,673 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) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,711 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-20 08:17:34,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,741 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-20 08:17:34,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,746 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-20 08:17:34,770 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-20 08:17:34,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,777 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) [2020-10-20 08:17:34,801 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-20 08:17:34,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,813 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-20 08:17:34,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:34,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,846 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-20 08:17:34,870 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-20 08:17:34,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:34,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:34,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:34,875 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-20 08:17:34,898 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-20 08:17:34,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:34,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:34,944 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-20 08:17:34,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,952 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) [2020-10-20 08:17:34,975 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-20 08:17:34,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:34,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:34,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:34,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:34,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:34,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:34,980 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-20 08:17:35,002 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-20 08:17:35,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,007 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-20 08:17:35,031 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-20 08:17:35,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,043 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-20 08:17:35,066 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-20 08:17:35,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,073 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-20 08:17:35,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-20 08:17:35,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,099 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-20 08:17:35,123 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-20 08:17:35,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,128 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-20 08:17:35,151 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-20 08:17:35,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:35,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:35,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:35,154 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-20 08:17:35,178 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-20 08:17:35,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:35,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:35,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:35,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:35,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:35,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:35,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:35,264 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-20 08:17:35,264 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-20 08:17:35,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:35,268 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:35,269 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:35,269 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2020-10-20 08:17:35,854 INFO L297 tatePredicateManager]: 86 out of 86 supporting invariants were superfluous and have been removed [2020-10-20 08:17:35,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:35,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:35,976 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:17:35,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:36,008 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-20 08:17:36,008 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-20 08:17:36,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-20 08:17:36,032 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-20 08:17:36,034 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-20 08:17:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-20 08:17:36,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2020-10-20 08:17:36,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:36,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2020-10-20 08:17:36,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:36,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2020-10-20 08:17:36,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:36,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2020-10-20 08:17:36,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:17:36,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2020-10-20 08:17:36,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:17:36,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:17:36,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:17:36,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:36,055 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:36,055 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:36,055 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:36,055 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-20 08:17:36,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:17:36,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:17:36,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:17:36,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:17:36 BoogieIcfgContainer [2020-10-20 08:17:36,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:17:36,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:17:36,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:17:36,075 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:17:36,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:39" (3/4) ... [2020-10-20 08:17:36,079 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:17:36,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:17:36,081 INFO L168 Benchmark]: Toolchain (without parser) took 57845.44 ms. Allocated memory was 35.1 MB in the beginning and 173.0 MB in the end (delta: 137.9 MB). Free memory was 11.7 MB in the beginning and 137.9 MB in the end (delta: -126.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,081 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 33.0 MB. Free memory was 17.7 MB in the beginning and 17.7 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.71 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 10.9 MB in the beginning and 22.7 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.66 ms. Allocated memory is still 43.5 MB. Free memory was 22.7 MB in the beginning and 20.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,083 INFO L168 Benchmark]: Boogie Preprocessor took 43.60 ms. Allocated memory is still 43.5 MB. Free memory was 20.7 MB in the beginning and 18.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,084 INFO L168 Benchmark]: RCFGBuilder took 449.25 ms. Allocated memory was 43.5 MB in the beginning and 46.1 MB in the end (delta: 2.6 MB). Free memory was 18.9 MB in the beginning and 26.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,084 INFO L168 Benchmark]: BuchiAutomizer took 56844.07 ms. Allocated memory was 46.1 MB in the beginning and 173.0 MB in the end (delta: 126.9 MB). Free memory was 26.9 MB in the beginning and 137.9 MB in the end (delta: -111.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:36,084 INFO L168 Benchmark]: Witness Printer took 4.93 ms. Allocated memory is still 173.0 MB. Free memory is still 137.9 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:17:36,086 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.30 ms. Allocated memory is still 33.0 MB. Free memory was 17.7 MB in the beginning and 17.7 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 441.71 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 10.9 MB in the beginning and 22.7 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.66 ms. Allocated memory is still 43.5 MB. Free memory was 22.7 MB in the beginning and 20.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 43.60 ms. Allocated memory is still 43.5 MB. Free memory was 20.7 MB in the beginning and 18.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 449.25 ms. Allocated memory was 43.5 MB in the beginning and 46.1 MB in the end (delta: 2.6 MB). Free memory was 18.9 MB in the beginning and 26.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 56844.07 ms. Allocated memory was 46.1 MB in the beginning and 173.0 MB in the end (delta: 126.9 MB). Free memory was 26.9 MB in the beginning and 137.9 MB in the end (delta: -111.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 14.3 GB. * Witness Printer took 4.93 ms. Allocated memory is still 173.0 MB. Free memory is still 137.9 MB. There was no memory consumed. Max. memory is 14.3 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 19 * unknown-#length-unknown[x] + -8 * i 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 17 * unknown-#length-unknown[x] + -16 * i 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 56.7s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 53.8s. Construction of modules took 1.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.1s 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: 25ms 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...