./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 20ed64ec 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.5.800.v20200727-1323.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.2.1-dev-20ed64e [2021-08-27 17:34:12,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:34:12,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:34:12,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:34:12,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:34:12,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:34:12,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:34:12,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:34:12,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:34:12,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:34:12,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:34:12,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:34:12,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:34:12,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:34:12,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:34:12,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:34:12,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:34:12,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:34:12,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:34:12,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:34:12,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:34:12,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:34:12,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:34:12,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:34:12,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:34:12,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:34:12,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:34:12,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:34:12,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:34:12,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:34:12,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:34:12,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:34:12,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:34:12,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:34:12,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:34:12,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:34:12,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:34:12,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:34:12,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:34:12,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:34:12,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:34:12,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:34:12,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:34:12,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:34:12,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:34:12,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:34:12,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:34:12,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:34:12,671 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:34:12,671 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:34:12,671 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:34:12,672 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:34:12,672 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:34:12,672 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:34:12,672 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:34:12,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:34:12,673 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:34:12,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:34:12,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:34:12,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:34:12,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:34:12,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:34:12,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:34:12,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:34:12,675 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:34:12,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:34:12,675 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:34:12,675 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:34:12,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:34:12,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:34:12,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:34:12,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:34:12,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:34:12,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:34:12,678 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:34:12,678 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2021-08-27 17:34:12,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:34:12,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:34:12,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:34:12,999 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:34:13,000 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:34:13,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2021-08-27 17:34:13,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e76a00cf/ae4902504b5246218586e83d360b3c6a/FLAG06cec762d [2021-08-27 17:34:13,492 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:34:13,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2021-08-27 17:34:13,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e76a00cf/ae4902504b5246218586e83d360b3c6a/FLAG06cec762d [2021-08-27 17:34:13,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e76a00cf/ae4902504b5246218586e83d360b3c6a [2021-08-27 17:34:13,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:34:13,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:34:13,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:34:13,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:34:13,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:34:13,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5e973c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13, skipping insertion in model container [2021-08-27 17:34:13,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:34:13,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:34:13,682 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i[1290,1303] [2021-08-27 17:34:13,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:34:13,689 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:34:13,705 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i[1290,1303] [2021-08-27 17:34:13,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:34:13,747 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:34:13,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13 WrapperNode [2021-08-27 17:34:13,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:34:13,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:34:13,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:34:13,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:34:13,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:34:13,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:34:13,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:34:13,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:34:13,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:34:13,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:34:13,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:34:13,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:34:13,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (1/1) ... [2021-08-27 17:34:13,859 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:13,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:13,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:34:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:34:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:34:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:34:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:34:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:34:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:34:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:34:14,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:34:14,297 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-27 17:34:14,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:34:14 BoogieIcfgContainer [2021-08-27 17:34:14,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:34:14,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:34:14,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:34:14,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:34:14,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:14,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:34:13" (1/3) ... [2021-08-27 17:34:14,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cd4e278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:34:14, skipping insertion in model container [2021-08-27 17:34:14,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:14,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:13" (2/3) ... [2021-08-27 17:34:14,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cd4e278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:34:14, skipping insertion in model container [2021-08-27 17:34:14,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:14,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:34:14" (3/3) ... [2021-08-27 17:34:14,312 INFO L389 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2021-08-27 17:34:14,358 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:34:14,358 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:34:14,358 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:34:14,358 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:34:14,359 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:34:14,359 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:34:14,359 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:34:14,359 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:34:14,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:14,384 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2021-08-27 17:34:14,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:14,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:14,388 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:34:14,388 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:34:14,388 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:34:14,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:14,391 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2021-08-27 17:34:14,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:14,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:14,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:34:14,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:34:14,396 INFO L791 eck$LassoCheckResult]: Stem: 19#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; 17#L34-3true [2021-08-27 17:34:14,396 INFO L793 eck$LassoCheckResult]: Loop: 17#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; 11#L34-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 17#L34-3true [2021-08-27 17:34:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:34:14,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:14,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107620234] [2021-08-27 17:34:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:14,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,477 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 17:34:14,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:14,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952640731] [2021-08-27 17:34:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:14,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,551 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 17:34:14,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:14,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81192776] [2021-08-27 17:34:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:14,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,599 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:14,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:15,251 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:15,251 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:15,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:15,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:15,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:15,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:15,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:15,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:15,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2021-08-27 17:34:15,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:15,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:15,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:15,911 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:15,914 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:34:15,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:15,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:15,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 17:34:15,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:15,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:15,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:15,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:15,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:15,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:15,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:15,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:15,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:15,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:15,977 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:15,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:15,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 17:34:15,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:15,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:15,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:15,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:15,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:15,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:15,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:15,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:15,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-27 17:34:16,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 17:34:16,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 17:34:16,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,137 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 17:34:16,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-08-27 17:34:16,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,169 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 17:34:16,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,196 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 17:34:16,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 17:34:16,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 17:34:16,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,343 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:34:16,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,388 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,389 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:34:16,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:34:16,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,460 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,461 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 17:34:16,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,492 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,492 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:34:16,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,519 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:34:16,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-08-27 17:34:16,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,552 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:34:16,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,580 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,581 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 17:34:16,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,638 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,639 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 17:34:16,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:16,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:16,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:16,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,669 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 17:34:16,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-27 17:34:16,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 17:34:16,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,733 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:34:16,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:16,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:16,809 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,813 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:16,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:16,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:16,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:16,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:16,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:16,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:16,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:34:16,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:34:16,871 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-08-27 17:34:16,872 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 17:34:16,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:16,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:16,888 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:16,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:34:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 17:34:16,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:34:16,941 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:34:16,942 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-27 17:34:17,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:17,020 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:34:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:34:17,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,097 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:17,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:17,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,171 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 [2021-08-27 17:34:17,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 119 transitions. Complement of second has 8 states. [2021-08-27 17:34:17,250 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 [2021-08-27 17:34:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2021-08-27 17:34:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 17:34:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:34:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 17:34:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:17,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2021-08-27 17:34:17,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2021-08-27 17:34:17,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-08-27 17:34:17,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:17,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2021-08-27 17:34:17,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:17,262 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-08-27 17:34:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2021-08-27 17:34:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-27 17:34:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-08-27 17:34:17,282 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-08-27 17:34:17,282 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-08-27 17:34:17,282 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:34:17,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2021-08-27 17:34:17,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:17,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:17,283 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:34:17,283 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:17,283 INFO L791 eck$LassoCheckResult]: Stem: 187#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); 188#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; 196#L34-3 assume !(main_~i~1 < 10); 189#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; 190#L20-3 [2021-08-27 17:34:17,283 INFO L793 eck$LassoCheckResult]: Loop: 190#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 203#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; 204#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 205#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 190#L20-3 [2021-08-27 17:34:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 17:34:17,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047849370] [2021-08-27 17:34:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:17,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047849370] [2021-08-27 17:34:17,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047849370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:17,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:34:17,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:34:17,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841887099] [2021-08-27 17:34:17,326 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2021-08-27 17:34:17,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611786386] [2021-08-27 17:34:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,332 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:17,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:34:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:34:17,393 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:17,413 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-08-27 17:34:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:34:17,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2021-08-27 17:34:17,417 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2021-08-27 17:34:17,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:17,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:17,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2021-08-27 17:34:17,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:17,420 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-08-27 17:34:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2021-08-27 17:34:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 17:34:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-08-27 17:34:17,427 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-08-27 17:34:17,427 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-08-27 17:34:17,427 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:34:17,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2021-08-27 17:34:17,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:17,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:17,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:34:17,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:17,431 INFO L791 eck$LassoCheckResult]: Stem: 242#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); 243#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; 253#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 256#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 257#L34-3 assume !(main_~i~1 < 10); 246#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; 247#L20-3 [2021-08-27 17:34:17,431 INFO L793 eck$LassoCheckResult]: Loop: 247#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 260#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; 261#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 262#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 247#L20-3 [2021-08-27 17:34:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 17:34:17,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079089339] [2021-08-27 17:34:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:17,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079089339] [2021-08-27 17:34:17,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079089339] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:17,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878248330] [2021-08-27 17:34:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,490 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:17,493 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:17,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 17:34:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:34:17,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878248330] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:17,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:17,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:34:17,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14257343] [2021-08-27 17:34:17,575 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2021-08-27 17:34:17,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38994900] [2021-08-27 17:34:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,586 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:17,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:34:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:34:17,643 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:17,661 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2021-08-27 17:34:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:17,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2021-08-27 17:34:17,663 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2021-08-27 17:34:17,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:17,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:17,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2021-08-27 17:34:17,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:17,664 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-27 17:34:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2021-08-27 17:34:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-08-27 17:34:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-08-27 17:34:17,666 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-08-27 17:34:17,666 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-08-27 17:34:17,666 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:34:17,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2021-08-27 17:34:17,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:17,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:17,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:34:17,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:17,667 INFO L791 eck$LassoCheckResult]: Stem: 318#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); 319#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; 329#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 332#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 333#L34-3 assume !!(main_~i~1 < 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; 342#L34-3 assume !(main_~i~1 < 10); 322#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; 323#L20-3 [2021-08-27 17:34:17,667 INFO L793 eck$LassoCheckResult]: Loop: 323#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 336#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; 337#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 338#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 323#L20-3 [2021-08-27 17:34:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 17:34:17,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346277143] [2021-08-27 17:34:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:17,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346277143] [2021-08-27 17:34:17,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346277143] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:17,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664303533] [2021-08-27 17:34:17,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:17,710 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:17,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:17,711 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:17,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-27 17:34:17,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:17,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:17,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:17,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664303533] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:17,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:17,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:34:17,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615819836] [2021-08-27 17:34:17,806 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2021-08-27 17:34:17,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643593073] [2021-08-27 17:34:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,811 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:17,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:17,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:34:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:34:17,866 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:17,881 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-08-27 17:34:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:34:17,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2021-08-27 17:34:17,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2021-08-27 17:34:17,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:17,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:17,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-08-27 17:34:17,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:17,884 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 17:34:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-08-27 17:34:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-08-27 17:34:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-08-27 17:34:17,887 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-08-27 17:34:17,887 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-08-27 17:34:17,887 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:34:17,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2021-08-27 17:34:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:17,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:17,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:17,888 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:34:17,888 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:17,888 INFO L791 eck$LassoCheckResult]: Stem: 407#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); 408#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; 416#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 419#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 420#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 431#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 428#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 429#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 430#L34-3 assume !(main_~i~1 < 10); 409#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; 410#L20-3 [2021-08-27 17:34:17,888 INFO L793 eck$LassoCheckResult]: Loop: 410#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 423#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; 424#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 425#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 410#L20-3 [2021-08-27 17:34:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 17:34:17,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:17,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960482853] [2021-08-27 17:34:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:17,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:17,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:17,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960482853] [2021-08-27 17:34:17,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960482853] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:17,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349681348] [2021-08-27 17:34:17,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:17,931 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:17,932 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:17,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-27 17:34:17,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:34:17,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:17,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:34:17,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349681348] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:18,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:34:18,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402676413] [2021-08-27 17:34:18,052 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2021-08-27 17:34:18,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015994977] [2021-08-27 17:34:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,057 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:18,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:34:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:34:18,111 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:18,129 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2021-08-27 17:34:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:34:18,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2021-08-27 17:34:18,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2021-08-27 17:34:18,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:18,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:18,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2021-08-27 17:34:18,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:18,132 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-27 17:34:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2021-08-27 17:34:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-08-27 17:34:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-08-27 17:34:18,134 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-27 17:34:18,134 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-27 17:34:18,134 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:34:18,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-08-27 17:34:18,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:18,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:18,135 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:34:18,135 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:18,136 INFO L791 eck$LassoCheckResult]: Stem: 503#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); 504#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; 514#L34-3 assume !!(main_~i~1 < 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; 527#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 517#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 518#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 531#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 530#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 529#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); 507#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; 508#L20-3 [2021-08-27 17:34:18,136 INFO L793 eck$LassoCheckResult]: Loop: 508#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 521#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; 522#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 523#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 508#L20-3 [2021-08-27 17:34:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 17:34:18,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941340997] [2021-08-27 17:34:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:18,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941340997] [2021-08-27 17:34:18,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941340997] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45457702] [2021-08-27 17:34:18,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:34:18,184 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:18,185 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 17:34:18,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:34:18,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:18,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:18,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45457702] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:18,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:34:18,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486087574] [2021-08-27 17:34:18,320 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2021-08-27 17:34:18,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820358632] [2021-08-27 17:34:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,325 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:18,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:34:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:34:18,385 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:18,407 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-08-27 17:34:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:34:18,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2021-08-27 17:34:18,408 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2021-08-27 17:34:18,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:18,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:18,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2021-08-27 17:34:18,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:18,409 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-27 17:34:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2021-08-27 17:34:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-08-27 17:34:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-08-27 17:34:18,411 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-08-27 17:34:18,411 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-08-27 17:34:18,411 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:34:18,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2021-08-27 17:34:18,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:18,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:18,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 17:34:18,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:18,412 INFO L791 eck$LassoCheckResult]: Stem: 612#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); 613#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; 623#L34-3 assume !!(main_~i~1 < 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; 636#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 626#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 627#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 640#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 639#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 638#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); 616#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; 617#L20-3 [2021-08-27 17:34:18,412 INFO L793 eck$LassoCheckResult]: Loop: 617#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 630#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; 631#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 632#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 617#L20-3 [2021-08-27 17:34:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 17:34:18,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755312474] [2021-08-27 17:34:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:18,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755312474] [2021-08-27 17:34:18,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755312474] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390003729] [2021-08-27 17:34:18,472 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:34:18,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:18,477 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:18,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 17:34:18,552 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 17:34:18,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:18,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:34:18,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390003729] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:18,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 17:34:18,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169496727] [2021-08-27 17:34:18,619 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2021-08-27 17:34:18,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361815863] [2021-08-27 17:34:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,623 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,626 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:18,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:34:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:34:18,682 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:18,705 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-08-27 17:34:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:34:18,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2021-08-27 17:34:18,706 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2021-08-27 17:34:18,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:18,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:18,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2021-08-27 17:34:18,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:18,707 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-08-27 17:34:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2021-08-27 17:34:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-08-27 17:34:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2021-08-27 17:34:18,709 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-08-27 17:34:18,709 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-08-27 17:34:18,709 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:34:18,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2021-08-27 17:34:18,710 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:18,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:18,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:18,710 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2021-08-27 17:34:18,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:18,711 INFO L791 eck$LassoCheckResult]: Stem: 734#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); 735#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; 743#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 755#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; 746#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 747#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 760#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 759#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 758#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 757#L34-3 assume !(main_~i~1 < 10); 736#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; 737#L20-3 [2021-08-27 17:34:18,711 INFO L793 eck$LassoCheckResult]: Loop: 737#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 750#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; 751#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 752#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 737#L20-3 [2021-08-27 17:34:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2021-08-27 17:34:18,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899057049] [2021-08-27 17:34:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:18,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899057049] [2021-08-27 17:34:18,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899057049] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887198164] [2021-08-27 17:34:18,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:34:18,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:18,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:18,780 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:18,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-27 17:34:18,884 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 17:34:18,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:18,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:34:18,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:18,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887198164] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:18,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:18,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 17:34:18,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295234577] [2021-08-27 17:34:18,946 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2021-08-27 17:34:18,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:18,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401754068] [2021-08-27 17:34:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:18,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,951 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:18,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:19,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:34:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:34:19,006 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:19,031 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2021-08-27 17:34:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:34:19,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2021-08-27 17:34:19,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2021-08-27 17:34:19,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:19,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:19,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2021-08-27 17:34:19,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:19,033 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-08-27 17:34:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2021-08-27 17:34:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-08-27 17:34:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2021-08-27 17:34:19,035 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-08-27 17:34:19,036 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-08-27 17:34:19,036 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:34:19,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2021-08-27 17:34:19,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:19,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:19,037 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2021-08-27 17:34:19,037 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:19,037 INFO L791 eck$LassoCheckResult]: Stem: 865#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); 866#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; 874#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 886#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; 877#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 878#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 891#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 890#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 889#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 888#L34-3 assume !(main_~i~1 < 10); 867#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; 868#L20-3 [2021-08-27 17:34:19,037 INFO L793 eck$LassoCheckResult]: Loop: 868#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 881#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; 882#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 883#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 868#L20-3 [2021-08-27 17:34:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2021-08-27 17:34:19,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:19,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74704727] [2021-08-27 17:34:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:19,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:19,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:19,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74704727] [2021-08-27 17:34:19,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74704727] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:19,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614702359] [2021-08-27 17:34:19,132 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:34:19,132 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:19,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:19,134 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:19,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-27 17:34:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:19,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:34:19,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:19,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614702359] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:19,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:19,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 17:34:19,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808514579] [2021-08-27 17:34:19,296 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2021-08-27 17:34:19,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:19,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471232406] [2021-08-27 17:34:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:19,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:19,303 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:19,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:19,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:34:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:34:19,369 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:19,399 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-08-27 17:34:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:34:19,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-08-27 17:34:19,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2021-08-27 17:34:19,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:19,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:19,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2021-08-27 17:34:19,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:19,402 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2021-08-27 17:34:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2021-08-27 17:34:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-08-27 17:34:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-08-27 17:34:19,404 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-08-27 17:34:19,404 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-08-27 17:34:19,404 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:34:19,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-08-27 17:34:19,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:19,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:19,405 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2021-08-27 17:34:19,405 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:19,405 INFO L791 eck$LassoCheckResult]: Stem: 1005#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); 1006#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; 1016#L34-3 assume !!(main_~i~1 < 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; 1029#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1019#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1020#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1033#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1032#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1031#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); 1009#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; 1010#L20-3 [2021-08-27 17:34:19,405 INFO L793 eck$LassoCheckResult]: Loop: 1010#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1023#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; 1024#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1025#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1010#L20-3 [2021-08-27 17:34:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2021-08-27 17:34:19,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:19,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754439992] [2021-08-27 17:34:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:19,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:19,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:19,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754439992] [2021-08-27 17:34:19,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754439992] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:19,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674277390] [2021-08-27 17:34:19,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:19,509 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:19,510 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:19,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-27 17:34:19,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:19,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:19,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:34:19,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:19,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674277390] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:19,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:19,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 17:34:19,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270133794] [2021-08-27 17:34:19,682 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2021-08-27 17:34:19,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:19,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552054289] [2021-08-27 17:34:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:19,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:19,687 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:19,690 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:19,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:34:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:34:19,754 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:19,785 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2021-08-27 17:34:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:34:19,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2021-08-27 17:34:19,786 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2021-08-27 17:34:19,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:19,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:19,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2021-08-27 17:34:19,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:19,787 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2021-08-27 17:34:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2021-08-27 17:34:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-08-27 17:34:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-08-27 17:34:19,790 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-08-27 17:34:19,790 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-08-27 17:34:19,790 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:34:19,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2021-08-27 17:34:19,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:19,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:19,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:19,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2021-08-27 17:34:19,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:19,791 INFO L791 eck$LassoCheckResult]: Stem: 1158#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); 1159#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; 1169#L34-3 assume !!(main_~i~1 < 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; 1182#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1172#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1173#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1186#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1185#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1184#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); 1162#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; 1163#L20-3 [2021-08-27 17:34:19,791 INFO L793 eck$LassoCheckResult]: Loop: 1163#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1176#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; 1177#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1178#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1163#L20-3 [2021-08-27 17:34:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2021-08-27 17:34:19,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:19,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829109999] [2021-08-27 17:34:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:19,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:19,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:19,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829109999] [2021-08-27 17:34:19,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829109999] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:19,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554359978] [2021-08-27 17:34:19,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:19,887 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:19,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:19,889 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-27 17:34:20,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 17:34:20,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:20,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:34:20,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:20,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554359978] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:20,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:20,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 17:34:20,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375673804] [2021-08-27 17:34:20,132 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2021-08-27 17:34:20,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:20,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939559471] [2021-08-27 17:34:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:20,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,136 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,139 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:20,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:34:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:34:20,192 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:20,227 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2021-08-27 17:34:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:34:20,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2021-08-27 17:34:20,228 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:20,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2021-08-27 17:34:20,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 17:34:20,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 17:34:20,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2021-08-27 17:34:20,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:20,229 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2021-08-27 17:34:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2021-08-27 17:34:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-08-27 17:34:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2021-08-27 17:34:20,231 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2021-08-27 17:34:20,231 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2021-08-27 17:34:20,231 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:34:20,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2021-08-27 17:34:20,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:20,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:20,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:20,232 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-08-27 17:34:20,232 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:20,233 INFO L791 eck$LassoCheckResult]: Stem: 1323#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); 1324#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; 1332#L34-3 assume !!(main_~i~1 < 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; 1345#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1335#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1336#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1349#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1348#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1347#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); 1325#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; 1326#L20-3 [2021-08-27 17:34:20,233 INFO L793 eck$LassoCheckResult]: Loop: 1326#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1339#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; 1340#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1341#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1326#L20-3 [2021-08-27 17:34:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2021-08-27 17:34:20,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:20,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215590202] [2021-08-27 17:34:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:20,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,243 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,255 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2021-08-27 17:34:20,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:20,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423554115] [2021-08-27 17:34:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:20,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,259 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,261 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2021-08-27 17:34:20,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:20,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777317807] [2021-08-27 17:34:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:20,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,276 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:20,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:25,018 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:25,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:25,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:25,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:25,019 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:25,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:25,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:25,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2021-08-27 17:34:25,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:25,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:25,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:25,719 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:25,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:34:25,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,725 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:34:25,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:25,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,757 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:34:25,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 17:34:25,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,785 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 17:34:25,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:25,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,813 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 17:34:25,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:25,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:25,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-08-27 17:34:25,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,844 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:34:25,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 17:34:25,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,871 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:34:25,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 17:34:25,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,907 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:34:25,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:25,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:25,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,945 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:34:25,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:25,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:25,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:25,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-08-27 17:34:25,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:25,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:25,973 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:25,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:34:25,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:25,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:25,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:25,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:25,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:25,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:25,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:25,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,035 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,036 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:34:26,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,065 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:34:26,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,112 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,113 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:34:26,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 17:34:26,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,168 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:34:26,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-08-27 17:34:26,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,194 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:34:26,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-27 17:34:26,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,222 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 17:34:26,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-08-27 17:34:26,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,254 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 17:34:26,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-08-27 17:34:26,318 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,319 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 17:34:26,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,351 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 17:34:26,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:26,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:26,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:26,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-08-27 17:34:26,377 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,377 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 17:34:26,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,444 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 17:34:26,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,506 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 17:34:26,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,552 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,554 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 17:34:26,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:26,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 17:34:26,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,583 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 17:34:26,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:26,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:26,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:26,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:26,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:26,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:26,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:26,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:34:26,635 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 17:34:26,635 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 17:34:26,636 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:26,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:26,637 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:26,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 17:34:26,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:34:26,656 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:34:26,656 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:34:26,656 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2021-08-27 17:34:26,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:26,700 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 17:34:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:26,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:34:26,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:26,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:26,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:26,855 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 [2021-08-27 17:34:26,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:26,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 60 transitions. Complement of second has 7 states. [2021-08-27 17:34:26,871 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 [2021-08-27 17:34:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-08-27 17:34:26,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2021-08-27 17:34:26,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2021-08-27 17:34:26,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2021-08-27 17:34:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:26,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2021-08-27 17:34:26,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:26,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2021-08-27 17:34:26,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 17:34:26,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:26,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2021-08-27 17:34:26,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:26,875 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-08-27 17:34:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2021-08-27 17:34:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-08-27 17:34:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-08-27 17:34:26,877 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-08-27 17:34:26,878 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-08-27 17:34:26,878 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:34:26,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2021-08-27 17:34:26,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:26,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:26,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:26,879 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:26,879 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:26,879 INFO L791 eck$LassoCheckResult]: Stem: 1567#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); 1568#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; 1576#L34-3 assume !!(main_~i~1 < 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; 1590#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1579#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1580#L34-3 assume !!(main_~i~1 < 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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1594#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1593#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1592#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); 1569#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; 1570#L20-3 assume !(max_~i~0 < 10); 1577#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1578#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; 1575#L20-8 [2021-08-27 17:34:26,880 INFO L793 eck$LassoCheckResult]: Loop: 1575#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1563#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; 1564#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1581#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1575#L20-8 [2021-08-27 17:34:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2021-08-27 17:34:26,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:26,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374336698] [2021-08-27 17:34:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:26,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:26,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:26,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374336698] [2021-08-27 17:34:26,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374336698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:26,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:34:26,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:34:26,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587509367] [2021-08-27 17:34:26,909 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2021-08-27 17:34:26,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:26,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444560672] [2021-08-27 17:34:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:26,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:26,914 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:26,917 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:26,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:34:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:34:26,966 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:26,996 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2021-08-27 17:34:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:34:26,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2021-08-27 17:34:26,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:26,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2021-08-27 17:34:26,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 17:34:26,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 17:34:26,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2021-08-27 17:34:26,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:26,998 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2021-08-27 17:34:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2021-08-27 17:34:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2021-08-27 17:34:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-08-27 17:34:26,999 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-08-27 17:34:26,999 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-08-27 17:34:26,999 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:34:26,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2021-08-27 17:34:27,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:27,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:27,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:27,000 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:27,000 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:27,001 INFO L791 eck$LassoCheckResult]: Stem: 1670#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); 1671#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; 1681#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1684#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1685#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1695#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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1699#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1698#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1697#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1696#L34-3 assume !(main_~i~1 < 10); 1674#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; 1675#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1688#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1690#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1691#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1689#L20-3 assume !(max_~i~0 < 10); 1682#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1683#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; 1680#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1668#L21-3 [2021-08-27 17:34:27,001 INFO L793 eck$LassoCheckResult]: Loop: 1668#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; 1669#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1686#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1694#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1668#L21-3 [2021-08-27 17:34:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2021-08-27 17:34:27,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:27,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669779504] [2021-08-27 17:34:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:27,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:27,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669779504] [2021-08-27 17:34:27,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669779504] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:27,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923049189] [2021-08-27 17:34:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:27,037 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:27,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-08-27 17:34:27,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:27,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:34:27,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:27,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923049189] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:27,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:27,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:34:27,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685149830] [2021-08-27 17:34:27,279 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:27,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2021-08-27 17:34:27,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:27,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809406350] [2021-08-27 17:34:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:27,283 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:27,285 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:27,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:34:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:34:27,360 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:27,401 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2021-08-27 17:34:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:27,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2021-08-27 17:34:27,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:27,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2021-08-27 17:34:27,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-27 17:34:27,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 17:34:27,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2021-08-27 17:34:27,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:27,403 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2021-08-27 17:34:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2021-08-27 17:34:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-08-27 17:34:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-08-27 17:34:27,405 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-08-27 17:34:27,405 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-08-27 17:34:27,405 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:34:27,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2021-08-27 17:34:27,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:27,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:27,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:27,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:27,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:27,407 INFO L791 eck$LassoCheckResult]: Stem: 1883#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); 1884#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; 1894#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1897#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1898#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1911#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; 1929#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; 1924#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1922#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1921#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1920#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1918#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1916#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1915#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1914#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1913#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1912#L34-3 assume !(main_~i~1 < 10); 1887#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; 1888#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1901#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1919#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1917#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1902#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1903#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1904#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1905#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1906#L20-3 assume !(max_~i~0 < 10); 1895#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1896#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; 1907#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1930#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1928#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1910#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1893#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1881#L21-3 [2021-08-27 17:34:27,407 INFO L793 eck$LassoCheckResult]: Loop: 1881#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; 1882#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 1899#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1923#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1881#L21-3 [2021-08-27 17:34:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2021-08-27 17:34:27,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:27,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147309608] [2021-08-27 17:34:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-27 17:34:27,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:27,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147309608] [2021-08-27 17:34:27,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147309608] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:27,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78775728] [2021-08-27 17:34:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,456 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:27,457 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:27,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-27 17:34:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:27,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:27,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-27 17:34:27,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78775728] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:27,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:27,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:34:27,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175937951] [2021-08-27 17:34:27,725 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2021-08-27 17:34:27,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:27,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508577772] [2021-08-27 17:34:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:27,729 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:27,731 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:27,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:34:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:34:27,829 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:27,882 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2021-08-27 17:34:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:34:27,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2021-08-27 17:34:27,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:27,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2021-08-27 17:34:27,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-27 17:34:27,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 17:34:27,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2021-08-27 17:34:27,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:27,885 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-08-27 17:34:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2021-08-27 17:34:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2021-08-27 17:34:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.180327868852459) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2021-08-27 17:34:27,887 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2021-08-27 17:34:27,887 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2021-08-27 17:34:27,887 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 17:34:27,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2021-08-27 17:34:27,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:27,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:27,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:27,888 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:27,888 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:27,889 INFO L791 eck$LassoCheckResult]: Stem: 2141#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); 2142#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; 2153#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2157#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2173#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2195#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2194#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2193#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2192#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2190#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2189#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2188#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2187#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2186#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; 2181#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2180#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2177#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2176#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2175#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2174#L34-3 assume !(main_~i~1 < 10); 2145#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; 2146#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2161#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2199#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2162#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2163#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2164#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2165#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2166#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2168#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2169#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2178#L20-3 assume !(max_~i~0 < 10); 2154#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2155#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; 2167#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2139#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2140#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2172#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2151#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2152#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2158#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2159#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2197#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2183#L21-3 [2021-08-27 17:34:27,889 INFO L793 eck$LassoCheckResult]: Loop: 2183#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; 2196#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2185#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2182#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2183#L21-3 [2021-08-27 17:34:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2021-08-27 17:34:27,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:27,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242827513] [2021-08-27 17:34:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:27,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-27 17:34:27,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:27,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242827513] [2021-08-27 17:34:27,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242827513] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:27,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169857628] [2021-08-27 17:34:27,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:27,935 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:27,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:27,936 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:27,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-27 17:34:28,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:28,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:28,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:34:28,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-27 17:34:28,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169857628] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:28,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:28,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:34:28,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746825713] [2021-08-27 17:34:28,275 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2021-08-27 17:34:28,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:28,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942566747] [2021-08-27 17:34:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:28,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:28,279 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:28,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:28,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:34:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:34:28,363 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:28,445 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2021-08-27 17:34:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:34:28,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2021-08-27 17:34:28,446 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:28,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2021-08-27 17:34:28,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-27 17:34:28,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-08-27 17:34:28,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2021-08-27 17:34:28,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:28,447 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2021-08-27 17:34:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2021-08-27 17:34:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2021-08-27 17:34:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2021-08-27 17:34:28,449 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2021-08-27 17:34:28,449 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2021-08-27 17:34:28,449 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 17:34:28,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2021-08-27 17:34:28,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:28,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:28,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:28,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:28,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:28,451 INFO L791 eck$LassoCheckResult]: Stem: 2444#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); 2445#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; 2455#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2458#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2459#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2472#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; 2486#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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2481#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2479#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2476#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2475#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2474#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2473#L34-3 assume !(main_~i~1 < 10); 2448#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; 2449#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2462#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2465#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2466#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2463#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2464#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2467#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2468#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2502#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2501#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2500#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2499#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2498#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2478#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2496#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2480#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2477#L20-3 assume !(max_~i~0 < 10); 2456#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2457#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; 2454#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2442#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2443#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2460#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2471#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; 2509#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2508#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2507#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2506#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2505#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2504#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2503#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2483#L21-3 [2021-08-27 17:34:28,451 INFO L793 eck$LassoCheckResult]: Loop: 2483#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; 2497#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2485#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2482#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2483#L21-3 [2021-08-27 17:34:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2021-08-27 17:34:28,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:28,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864088434] [2021-08-27 17:34:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:28,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-08-27 17:34:28,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:28,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864088434] [2021-08-27 17:34:28,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864088434] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:28,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762205604] [2021-08-27 17:34:28,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:28,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:28,529 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:28,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-27 17:34:28,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 17:34:28,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:28,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:28,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-08-27 17:34:28,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762205604] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:28,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:28,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:34:28,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46520750] [2021-08-27 17:34:28,899 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2021-08-27 17:34:28,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:28,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287424390] [2021-08-27 17:34:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:28,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:28,904 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:28,906 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:29,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:34:29,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:34:29,013 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:29,100 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2021-08-27 17:34:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:34:29,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2021-08-27 17:34:29,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:29,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2021-08-27 17:34:29,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2021-08-27 17:34:29,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2021-08-27 17:34:29,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2021-08-27 17:34:29,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:29,102 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2021-08-27 17:34:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2021-08-27 17:34:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2021-08-27 17:34:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 76 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2021-08-27 17:34:29,104 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2021-08-27 17:34:29,105 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2021-08-27 17:34:29,105 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 17:34:29,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2021-08-27 17:34:29,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:29,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:29,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:29,106 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:29,106 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:29,106 INFO L791 eck$LassoCheckResult]: Stem: 2792#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); 2793#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; 2803#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2806#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2807#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2822#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2845#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2844#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2843#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2842#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2841#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2840#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2839#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2838#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2837#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2836#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2834#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2831#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2829#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2825#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2824#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2823#L34-3 assume !(main_~i~1 < 10); 2796#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; 2797#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2811#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2814#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2815#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2812#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2813#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2816#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2856#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2855#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2854#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2853#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2852#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2851#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2850#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2849#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2848#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2828#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2846#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2830#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2827#L20-3 assume !(max_~i~0 < 10); 2804#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2805#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; 2802#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2790#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2791#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2820#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2821#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2866#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2808#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2809#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2865#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2864#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2863#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2862#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2861#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2860#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2859#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2858#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2857#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2833#L21-3 [2021-08-27 17:34:29,106 INFO L793 eck$LassoCheckResult]: Loop: 2833#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; 2847#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 2835#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2832#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2833#L21-3 [2021-08-27 17:34:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2021-08-27 17:34:29,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:29,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361661510] [2021-08-27 17:34:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:29,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-08-27 17:34:29,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:29,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361661510] [2021-08-27 17:34:29,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361661510] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:29,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607452638] [2021-08-27 17:34:29,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:34:29,171 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:29,173 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:29,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-27 17:34:29,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:34:29,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:29,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:34:29,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-08-27 17:34:29,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607452638] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:29,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:29,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 17:34:29,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643338274] [2021-08-27 17:34:29,553 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2021-08-27 17:34:29,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:29,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597057320] [2021-08-27 17:34:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:29,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:29,558 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:29,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:29,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:34:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:34:29,637 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:29,747 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2021-08-27 17:34:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:34:29,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2021-08-27 17:34:29,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:29,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2021-08-27 17:34:29,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-27 17:34:29,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-27 17:34:29,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2021-08-27 17:34:29,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:29,750 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2021-08-27 17:34:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2021-08-27 17:34:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2021-08-27 17:34:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.2) internal successors, (102), 84 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2021-08-27 17:34:29,752 INFO L704 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2021-08-27 17:34:29,752 INFO L587 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2021-08-27 17:34:29,752 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 17:34:29,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2021-08-27 17:34:29,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:29,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:29,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:29,754 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:29,754 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:29,754 INFO L791 eck$LassoCheckResult]: Stem: 3187#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); 3188#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; 3197#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3200#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3201#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3215#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3238#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3237#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3236#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3235#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3234#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3233#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3232#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3231#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; 3228#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3227#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3226#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3224#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3221#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3220#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3219#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3218#L34-3 assume !(main_~i~1 < 10); 3189#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; 3190#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3204#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3207#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3210#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3205#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3206#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3253#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3208#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3209#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3252#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3251#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3250#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3249#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3248#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3247#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3246#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3245#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3244#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3243#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3242#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3241#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3223#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3239#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3225#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3222#L20-3 assume !(max_~i~0 < 10); 3198#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3199#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; 3195#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3196#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3213#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3214#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3183#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3184#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3202#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3266#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3265#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3264#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3263#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3262#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3261#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3260#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3259#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3258#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3257#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3256#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3255#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3254#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3217#L21-3 [2021-08-27 17:34:29,755 INFO L793 eck$LassoCheckResult]: Loop: 3217#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; 3240#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3230#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3216#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3217#L21-3 [2021-08-27 17:34:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2021-08-27 17:34:29,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:29,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550776820] [2021-08-27 17:34:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:29,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-27 17:34:29,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:29,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550776820] [2021-08-27 17:34:29,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550776820] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:29,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333617508] [2021-08-27 17:34:29,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:34:29,834 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:29,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:29,835 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:29,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-08-27 17:34:30,154 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-08-27 17:34:30,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:30,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:34:30,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-27 17:34:30,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333617508] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:30,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:30,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 17:34:30,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791345112] [2021-08-27 17:34:30,375 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2021-08-27 17:34:30,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:30,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757147626] [2021-08-27 17:34:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:30,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:30,380 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:30,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:30,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:34:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:34:30,453 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:30,565 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2021-08-27 17:34:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:34:30,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2021-08-27 17:34:30,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:30,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2021-08-27 17:34:30,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2021-08-27 17:34:30,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2021-08-27 17:34:30,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2021-08-27 17:34:30,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:30,568 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2021-08-27 17:34:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2021-08-27 17:34:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2021-08-27 17:34:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 92 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2021-08-27 17:34:30,570 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2021-08-27 17:34:30,570 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2021-08-27 17:34:30,570 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 17:34:30,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2021-08-27 17:34:30,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:30,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:30,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:30,572 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:30,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:30,572 INFO L791 eck$LassoCheckResult]: Stem: 3623#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); 3624#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; 3635#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3638#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3639#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3652#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3675#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3674#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3673#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3672#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3671#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3670#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3669#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3668#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3667#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3666#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3664#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3661#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3659#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3656#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3655#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3654#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3653#L34-3 assume !(main_~i~1 < 10); 3627#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; 3628#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3642#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3696#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3695#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3643#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3644#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3645#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3646#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3647#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3693#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3692#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3691#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3690#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3689#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3688#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3687#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3686#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3685#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3684#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3683#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3682#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3681#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3680#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3679#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3678#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3658#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3676#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3660#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3657#L20-3 assume !(max_~i~0 < 10); 3636#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3637#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; 3633#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3634#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3713#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3650#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3651#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3621#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3622#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3640#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3712#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3711#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3710#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3709#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3708#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3707#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3706#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3705#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3704#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3703#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3702#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3701#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3700#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3699#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3698#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3697#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); 3663#L21-3 [2021-08-27 17:34:30,572 INFO L793 eck$LassoCheckResult]: Loop: 3663#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; 3677#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 3665#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3662#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3663#L21-3 [2021-08-27 17:34:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2021-08-27 17:34:30,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:30,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198881282] [2021-08-27 17:34:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:30,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-08-27 17:34:30,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:30,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198881282] [2021-08-27 17:34:30,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198881282] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:30,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885529703] [2021-08-27 17:34:30,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:34:30,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:30,665 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:30,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-08-27 17:34:31,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-08-27 17:34:31,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:31,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:34:31,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-08-27 17:34:31,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885529703] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:31,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:31,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 17:34:31,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810164538] [2021-08-27 17:34:31,323 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2021-08-27 17:34:31,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:31,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157502738] [2021-08-27 17:34:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:31,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:31,328 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:31,330 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:31,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:34:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:34:31,401 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:31,520 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2021-08-27 17:34:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:34:31,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2021-08-27 17:34:31,522 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:31,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2021-08-27 17:34:31,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-08-27 17:34:31,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-08-27 17:34:31,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2021-08-27 17:34:31,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:31,524 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2021-08-27 17:34:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2021-08-27 17:34:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2021-08-27 17:34:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 100 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2021-08-27 17:34:31,527 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2021-08-27 17:34:31,527 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2021-08-27 17:34:31,527 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 17:34:31,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2021-08-27 17:34:31,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:31,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:31,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:31,529 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:31,529 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:31,530 INFO L791 eck$LassoCheckResult]: Stem: 4106#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); 4107#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; 4118#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4121#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4122#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4135#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4158#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4157#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4156#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4155#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4154#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4153#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4152#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4151#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4150#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4149#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4147#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4144#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4142#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4139#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4138#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4137#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); 4110#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; 4111#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4125#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4183#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4182#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4126#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4127#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4128#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4129#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4130#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4180#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4179#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4178#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4177#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4176#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4174#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4173#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4172#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4171#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4170#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4169#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4168#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4167#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4166#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4165#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4164#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4163#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4162#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4161#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4141#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4159#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4143#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4140#L20-3 assume !(max_~i~0 < 10); 4119#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4120#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; 4116#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4117#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4204#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4133#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4134#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4104#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4105#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4123#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4203#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4202#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4201#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4200#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4199#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4198#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4197#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4196#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4195#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4194#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4193#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4192#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4191#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4190#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4189#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4188#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4187#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4186#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4185#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4184#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); 4146#L21-3 [2021-08-27 17:34:31,530 INFO L793 eck$LassoCheckResult]: Loop: 4146#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; 4160#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4148#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4145#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4146#L21-3 [2021-08-27 17:34:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2021-08-27 17:34:31,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:31,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863507051] [2021-08-27 17:34:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:31,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2021-08-27 17:34:31,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:31,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863507051] [2021-08-27 17:34:31,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863507051] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:31,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339895773] [2021-08-27 17:34:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:34:31,660 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:31,665 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:31,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-08-27 17:34:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:32,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:34:32,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2021-08-27 17:34:32,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339895773] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:32,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:32,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 17:34:32,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37947547] [2021-08-27 17:34:32,243 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2021-08-27 17:34:32,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:32,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216110314] [2021-08-27 17:34:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:32,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:32,248 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:32,250 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:32,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:32,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:34:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:34:32,333 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:32,452 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2021-08-27 17:34:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:34:32,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2021-08-27 17:34:32,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:32,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2021-08-27 17:34:32,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2021-08-27 17:34:32,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2021-08-27 17:34:32,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2021-08-27 17:34:32,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:32,455 INFO L681 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2021-08-27 17:34:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2021-08-27 17:34:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2021-08-27 17:34:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2021-08-27 17:34:32,457 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2021-08-27 17:34:32,458 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2021-08-27 17:34:32,458 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 17:34:32,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2021-08-27 17:34:32,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:32,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:32,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:32,459 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:32,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:32,460 INFO L791 eck$LassoCheckResult]: Stem: 4634#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); 4635#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; 4645#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4663#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4664#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4648#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4649#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4686#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4685#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4684#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4683#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4682#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4681#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4680#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4679#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4678#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; 4673#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4671#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4668#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4667#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4666#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4665#L34-3 assume !(main_~i~1 < 10); 4638#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; 4639#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4652#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4658#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4659#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4653#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4654#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4655#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4656#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4657#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4712#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4711#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4710#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4709#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4708#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4707#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4706#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4705#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4704#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4703#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4702#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4701#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4700#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4699#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4698#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4697#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4696#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4695#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4694#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4693#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4692#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4691#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4690#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4689#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4670#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4687#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4672#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4669#L20-3 assume !(max_~i~0 < 10); 4646#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4647#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; 4644#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4632#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4633#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4650#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4662#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4740#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4739#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4738#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4737#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4736#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4735#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4734#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4733#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4732#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4731#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4730#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4729#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4728#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4727#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4726#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4725#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4724#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4723#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4722#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4721#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4720#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4719#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4718#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4717#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4716#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4715#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4714#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4713#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4675#L21-3 [2021-08-27 17:34:32,460 INFO L793 eck$LassoCheckResult]: Loop: 4675#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; 4688#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 4677#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4674#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4675#L21-3 [2021-08-27 17:34:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2021-08-27 17:34:32,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:32,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842477602] [2021-08-27 17:34:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:32,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-08-27 17:34:32,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:32,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842477602] [2021-08-27 17:34:32,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842477602] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:32,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139098724] [2021-08-27 17:34:32,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:32,568 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:32,573 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:32,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-08-27 17:34:32,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:32,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:32,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:34:32,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-08-27 17:34:33,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139098724] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:33,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:33,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 17:34:33,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104300443] [2021-08-27 17:34:33,170 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2021-08-27 17:34:33,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:33,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566865996] [2021-08-27 17:34:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:33,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:33,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:34:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:34:33,270 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:33,402 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2021-08-27 17:34:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:34:33,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2021-08-27 17:34:33,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:33,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2021-08-27 17:34:33,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2021-08-27 17:34:33,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2021-08-27 17:34:33,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2021-08-27 17:34:33,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:33,406 INFO L681 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2021-08-27 17:34:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2021-08-27 17:34:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2021-08-27 17:34:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2021-08-27 17:34:33,408 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2021-08-27 17:34:33,408 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2021-08-27 17:34:33,408 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 17:34:33,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2021-08-27 17:34:33,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:33,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:33,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:33,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:33,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:34:33,410 INFO L791 eck$LassoCheckResult]: Stem: 5200#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); 5201#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; 5209#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5212#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5213#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5226#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5258#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5256#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5254#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5252#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5250#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5248#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5246#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5244#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5242#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5240#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5239#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5237#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5235#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5232#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5231#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5230#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5229#L34-3 assume !(main_~i~1 < 10); 5202#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; 5203#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5217#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5292#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5291#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5218#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5219#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5220#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5221#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5222#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5288#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5286#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5284#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5282#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5280#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5278#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5276#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5274#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5272#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5270#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5269#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5267#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5265#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5264#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5263#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5262#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5261#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5260#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5259#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5257#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5255#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5253#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5251#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5249#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5247#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5245#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5243#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5241#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5238#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5236#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5233#L20-3 assume !(max_~i~0 < 10); 5210#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5211#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; 5223#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5312#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5214#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5215#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5208#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5196#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5197#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5311#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5310#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5309#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5308#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5307#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5306#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5305#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5304#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5303#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5302#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5301#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5300#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5299#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5298#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; 5296#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5295#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5294#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5293#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5290#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5289#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5287#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5285#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5283#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5281#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5279#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5277#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5275#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5273#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5271#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5228#L21-3 [2021-08-27 17:34:33,410 INFO L793 eck$LassoCheckResult]: Loop: 5228#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; 5268#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5266#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5227#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5228#L21-3 [2021-08-27 17:34:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2021-08-27 17:34:33,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:33,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246891435] [2021-08-27 17:34:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:33,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,465 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2021-08-27 17:34:33,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:33,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593065280] [2021-08-27 17:34:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:33,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,527 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:33,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2021-08-27 17:34:33,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:33,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338543168] [2021-08-27 17:34:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:33,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-08-27 17:34:33,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:33,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338543168] [2021-08-27 17:34:33,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338543168] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:33,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542836386] [2021-08-27 17:34:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:33,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:33,653 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:33,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-08-27 17:34:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:34,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 17:34:34,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-08-27 17:34:34,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542836386] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:34,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:34:34,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2021-08-27 17:34:34,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560321654] [2021-08-27 17:34:34,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:34:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2021-08-27 17:34:34,367 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:34,548 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2021-08-27 17:34:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 17:34:34,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2021-08-27 17:34:34,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:34:34,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2021-08-27 17:34:34,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-27 17:34:34,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2021-08-27 17:34:34,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2021-08-27 17:34:34,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:34,550 INFO L681 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2021-08-27 17:34:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2021-08-27 17:34:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-27 17:34:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1875) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2021-08-27 17:34:34,553 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2021-08-27 17:34:34,553 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2021-08-27 17:34:34,553 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 17:34:34,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2021-08-27 17:34:34,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:34:34,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:34,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:34,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:34,555 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:34:34,555 INFO L791 eck$LassoCheckResult]: Stem: 5809#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); 5810#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; 5818#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5821#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5822#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5831#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5863#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5861#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5859#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5857#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; 5853#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5851#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5849#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5847#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5845#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; 5841#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5839#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5837#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);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5833#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5832#L34-3 assume !(main_~i~1 < 10); 5813#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; 5814#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5824#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5898#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5827#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5828#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5825#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5826#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5829#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5895#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5893#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5891#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5889#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5887#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5885#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5883#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5881#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5879#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5877#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5875#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5873#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5871#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5869#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5867#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5866#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5865#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5864#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5862#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5860#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5858#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5856#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5854#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5852#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5850#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; 5846#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5844#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5842#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5840#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5838#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5836#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); 5819#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5820#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; 5817#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5807#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5808#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5823#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5830#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5918#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5917#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5916#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5915#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5914#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5913#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5912#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5911#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5910#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5909#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5908#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5907#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5906#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5905#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5904#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5903#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5902#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5901#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5900#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5899#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5897#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5896#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5894#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5892#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5890#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5888#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5886#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5884#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5882#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5880#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5878#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5876#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5874#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5872#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 5870#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5868#L20-8 assume !(max_~i~0 < 10); 5811#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5812#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; 5816#L43-3 [2021-08-27 17:34:34,555 INFO L793 eck$LassoCheckResult]: Loop: 5816#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; 5815#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 5816#L43-3 [2021-08-27 17:34:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2021-08-27 17:34:34,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:34,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203403636] [2021-08-27 17:34:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:34,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,610 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,680 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2021-08-27 17:34:34,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:34,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611870774] [2021-08-27 17:34:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:34,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,685 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2021-08-27 17:34:34,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:34,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563437028] [2021-08-27 17:34:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:34,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,723 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:34,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:56,526 WARN L207 SmtUtils]: Spent 21.68 s on a formula simplification. DAG size of input: 717 DAG size of output: 502 [2021-08-27 17:34:58,134 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:58,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:58,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:58,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:58,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:58,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:58,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:58,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:58,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2021-08-27 17:34:58,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:58,134 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:58,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:00,076 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:35:00,076 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:35:00,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,081 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-08-27 17:35:00,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-08-27 17:35:00,111 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,112 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-27 17:35:00,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,137 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,138 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-27 17:35:00,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-08-27 17:35:00,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,164 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-27 17:35:00,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,189 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,190 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-27 17:35:00,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 17:35:00,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,218 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-27 17:35:00,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-27 17:35:00,243 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,244 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-27 17:35:00,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-08-27 17:35:00,269 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,270 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-08-27 17:35:00,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-08-27 17:35:00,295 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,295 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-08-27 17:35:00,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-08-27 17:35:00,323 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,324 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-27 17:35:00,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-27 17:35:00,349 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,350 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-08-27 17:35:00,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-08-27 17:35:00,378 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,379 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-08-27 17:35:00,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,407 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-08-27 17:35:00,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,436 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-08-27 17:35:00,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-08-27 17:35:00,471 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,471 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-08-27 17:35:00,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-08-27 17:35:00,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,499 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-08-27 17:35:00,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-08-27 17:35:00,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,525 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-08-27 17:35:00,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,550 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-08-27 17:35:00,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-08-27 17:35:00,580 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,581 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-08-27 17:35:00,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-08-27 17:35:00,605 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,606 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-08-27 17:35:00,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,636 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-08-27 17:35:00,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,703 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,704 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-08-27 17:35:00,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,757 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,761 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-08-27 17:35:00,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,825 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,826 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-08-27 17:35:00,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,882 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-08-27 17:35:00,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-08-27 17:35:00,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,926 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-08-27 17:35:00,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:00,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:00,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:00,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:00,983 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,983 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-08-27 17:35:00,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:00,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:00,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:00,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:00,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:00,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:00,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:00,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:00,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-08-27 17:35:01,009 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,010 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-08-27 17:35:01,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-08-27 17:35:01,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,042 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-08-27 17:35:01,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:01,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:01,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:01,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-08-27 17:35:01,068 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,069 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-08-27 17:35:01,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-08-27 17:35:01,097 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,097 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-08-27 17:35:01,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-08-27 17:35:01,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,125 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-08-27 17:35:01,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-08-27 17:35:01,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,154 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-08-27 17:35:01,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-08-27 17:35:01,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,182 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-08-27 17:35:01,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-08-27 17:35:01,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,214 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-08-27 17:35:01,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-08-27 17:35:01,244 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,245 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-08-27 17:35:01,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:01,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:01,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:01,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-08-27 17:35:01,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,271 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-08-27 17:35:01,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:01,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:01,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:01,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-08-27 17:35:01,300 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,301 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-08-27 17:35:01,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:01,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:01,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:01,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:01,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2021-08-27 17:35:01,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,327 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-08-27 17:35:01,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:01,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:01,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:01,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:01,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:01,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:01,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:01,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:35:01,376 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-08-27 17:35:01,377 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-08-27 17:35:01,377 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,378 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-08-27 17:35:01,380 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:35:01,387 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:35:01,387 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:35:01,387 INFO L515 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 [] [2021-08-27 17:35:01,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-08-27 17:35:01,761 INFO L297 tatePredicateManager]: 91 out of 91 supporting invariants were superfluous and have been removed [2021-08-27 17:35:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:01,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:01,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:35:01,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:02,206 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:02,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:02,233 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 [2021-08-27 17:35:02,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:02,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 136 transitions. Complement of second has 4 states. [2021-08-27 17:35:02,246 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 [2021-08-27 17:35:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2021-08-27 17:35:02,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2021-08-27 17:35:02,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:02,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2021-08-27 17:35:02,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:02,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2021-08-27 17:35:02,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:02,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2021-08-27 17:35:02,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:35:02,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:35:02,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:35:02,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:02,249 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 17:35:02,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:35:02,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:35:02,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:35:02,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:35:02 BoogieIcfgContainer [2021-08-27 17:35:02,254 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:35:02,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:35:02,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:35:02,254 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:35:02,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:34:14" (3/4) ... [2021-08-27 17:35:02,256 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:35:02,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:35:02,257 INFO L168 Benchmark]: Toolchain (without parser) took 48740.07 ms. Allocated memory was 67.1 MB in the beginning and 354.4 MB in the end (delta: 287.3 MB). Free memory was 43.9 MB in the beginning and 135.0 MB in the end (delta: -91.1 MB). Peak memory consumption was 194.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:02,257 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 52.4 MB. Free memory was 33.4 MB in the beginning and 33.4 MB in the end (delta: 36.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:02,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.51 ms. Allocated memory is still 67.1 MB. Free memory was 43.8 MB in the beginning and 50.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:02,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.03 ms. Allocated memory is still 67.1 MB. Free memory was 50.6 MB in the beginning and 48.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:02,258 INFO L168 Benchmark]: Boogie Preprocessor took 44.01 ms. Allocated memory is still 67.1 MB. Free memory was 48.8 MB in the beginning and 47.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:02,258 INFO L168 Benchmark]: RCFGBuilder took 451.72 ms. Allocated memory is still 67.1 MB. Free memory was 47.4 MB in the beginning and 45.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:02,258 INFO L168 Benchmark]: BuchiAutomizer took 47948.95 ms. Allocated memory was 67.1 MB in the beginning and 354.4 MB in the end (delta: 287.3 MB). Free memory was 45.5 MB in the beginning and 136.1 MB in the end (delta: -90.6 MB). Peak memory consumption was 196.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:02,258 INFO L168 Benchmark]: Witness Printer took 2.17 ms. Allocated memory is still 354.4 MB. Free memory was 136.1 MB in the beginning and 135.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:02,260 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.17 ms. Allocated memory is still 52.4 MB. Free memory was 33.4 MB in the beginning and 33.4 MB in the end (delta: 36.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 234.51 ms. Allocated memory is still 67.1 MB. Free memory was 43.8 MB in the beginning and 50.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.03 ms. Allocated memory is still 67.1 MB. Free memory was 50.6 MB in the beginning and 48.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.01 ms. Allocated memory is still 67.1 MB. Free memory was 48.8 MB in the beginning and 47.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 451.72 ms. Allocated memory is still 67.1 MB. Free memory was 47.4 MB in the beginning and 45.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 47948.95 ms. Allocated memory was 67.1 MB in the beginning and 354.4 MB in the end (delta: 287.3 MB). Free memory was 45.5 MB in the beginning and 136.1 MB in the end (delta: -90.6 MB). Peak memory consumption was 196.0 MB. Max. memory is 16.1 GB. * Witness Printer took 2.17 ms. Allocated memory is still 354.4 MB. Free memory was 136.1 MB in the beginning and 135.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * 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 47.9s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 45.4s. Construction of modules took 0.9s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 60.6ms 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: 637 SDtfs, 1256 SDslu, 1560 SDs, 0 SdLazy, 1147 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 931.7ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital420 mio100 ax100 hnf100 lsp96 ukn41 mio100 lsp42 div100 bol100 ite100 ukn100 eq164 hnf92 smp94 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms 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! [2021-08-27 17:35:02,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:02,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:02,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2021-08-27 17:35:02,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2021-08-27 17:35:03,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2021-08-27 17:35:03,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2021-08-27 17:35:03,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2021-08-27 17:35:03,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:03,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2021-08-27 17:35:04,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:04,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-08-27 17:35:04,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-08-27 17:35:04,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:04,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-27 17:35:05,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-08-27 17:35:05,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:05,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-08-27 17:35:05,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-27 17:35:05,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-08-27 17:35:06,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...