./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/termination-memory-alloca/array03-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:00:09,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:00:09,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:00:09,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:00:09,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:00:09,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:00:09,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:00:09,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:00:09,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:00:09,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:00:09,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:00:09,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:00:09,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:00:09,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:00:09,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:00:09,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:00:09,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:00:09,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:00:09,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:00:09,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:00:09,686 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:00:09,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:00:09,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:00:09,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:00:09,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:00:09,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:00:09,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:00:09,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:00:09,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:00:09,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:00:09,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:00:09,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:00:09,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:00:09,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:00:09,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:00:09,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:00:09,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:00:09,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:00:09,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:00:09,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:00:09,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:00:09,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:00:09,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:00:09,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:00:09,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:00:09,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:00:09,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:00:09,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:00:09,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:00:09,736 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:00:09,736 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:00:09,737 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:00:09,737 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:00:09,737 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:00:09,737 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:00:09,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:00:09,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:00:09,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:00:09,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:00:09,743 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:00:09,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:00:09,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:00:09,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:00:09,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:00:09,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:00:09,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:00:09,745 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:00:09,746 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 [2022-07-14 15:00:09,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:00:09,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:00:09,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:00:09,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:00:09,965 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:00:09,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-07-14 15:00:10,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882dd4a62/9426d81c367d4ac592bf684685587ffe/FLAGe45c5ddda [2022-07-14 15:00:10,568 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:00:10,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-07-14 15:00:10,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882dd4a62/9426d81c367d4ac592bf684685587ffe/FLAGe45c5ddda [2022-07-14 15:00:11,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882dd4a62/9426d81c367d4ac592bf684685587ffe [2022-07-14 15:00:11,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:00:11,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:00:11,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:00:11,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:00:11,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:00:11,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75207673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11, skipping insertion in model container [2022-07-14 15:00:11,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:00:11,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:00:11,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:00:11,428 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:00:11,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:00:11,477 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:00:11,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11 WrapperNode [2022-07-14 15:00:11,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:00:11,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:00:11,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:00:11,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:00:11,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,502 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-14 15:00:11,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:00:11,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:00:11,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:00:11,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:00:11,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:00:11,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:00:11,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:00:11,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:00:11,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (1/1) ... [2022-07-14 15:00:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:11,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:11,606 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) [2022-07-14 15:00:11,609 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 [2022-07-14 15:00:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:00:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:00:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:00:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:00:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:00:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:00:11,753 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:00:11,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:00:11,887 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:00:11,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:00:11,891 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:00:11,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:11 BoogieIcfgContainer [2022-07-14 15:00:11,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:00:11,892 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:00:11,892 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:00:11,894 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:00:11,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:11,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:00:11" (1/3) ... [2022-07-14 15:00:11,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59970961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:00:11, skipping insertion in model container [2022-07-14 15:00:11,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:11,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:11" (2/3) ... [2022-07-14 15:00:11,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59970961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:00:11, skipping insertion in model container [2022-07-14 15:00:11,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:11,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:11" (3/3) ... [2022-07-14 15:00:11,896 INFO L354 chiAutomizerObserver]: Analyzing ICFG array03-alloca-1.i [2022-07-14 15:00:11,927 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:00:11,927 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:00:11,927 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:00:11,927 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:00:11,928 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:00:11,928 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:00:11,928 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:00:11,928 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:00:11,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-07-14 15:00:11,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:00:11,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:11,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:11,944 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:00:11,944 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:00:11,944 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:00:11,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-07-14 15:00:11,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:00:11,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:11,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:11,946 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:00:11,946 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:00:11,950 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 14#L567true assume !(main_~array_size~0#1 < 1); 15#L567-2true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 7#L551-3true [2022-07-14 15:00:11,950 INFO L754 eck$LassoCheckResult]: Loop: 7#L551-3true assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10#L553true assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 8#L558-2true assume !true; 6#L558-3true call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12#L551-2true test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7#L551-3true [2022-07-14 15:00:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-14 15:00:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009331221] [2022-07-14 15:00:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2022-07-14 15:00:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:12,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964601385] [2022-07-14 15:00:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:12,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964601385] [2022-07-14 15:00:12,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964601385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:12,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:12,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:00:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581621379] [2022-07-14 15:00:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:12,121 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:00:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:00:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:00:12,145 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-07-14 15:00:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:12,149 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-14 15:00:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:00:12,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-14 15:00:12,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:00:12,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2022-07-14 15:00:12,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:00:12,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:00:12,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-07-14 15:00:12,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:00:12,159 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-14 15:00:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-07-14 15:00:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-14 15:00:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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) [2022-07-14 15:00:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-07-14 15:00:12,175 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-14 15:00:12,175 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-14 15:00:12,175 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:00:12,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-07-14 15:00:12,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:00:12,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:12,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:12,176 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:00:12,176 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:00:12,176 INFO L752 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 47#L567 assume !(main_~array_size~0#1 < 1); 48#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 44#L551-3 [2022-07-14 15:00:12,176 INFO L754 eck$LassoCheckResult]: Loop: 44#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 38#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 39#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 46#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 43#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44#L551-3 [2022-07-14 15:00:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-14 15:00:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:12,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164990759] [2022-07-14 15:00:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2022-07-14 15:00:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:12,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030362373] [2022-07-14 15:00:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2022-07-14 15:00:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:12,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333399248] [2022-07-14 15:00:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:12,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:12,540 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:12,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:12,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:12,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:12,541 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:12,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:12,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:12,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:12,541 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration2_Lasso [2022-07-14 15:00:12,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:12,542 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:12,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:12,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:12,909 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:12,924 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) [2022-07-14 15:00:12,930 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 [2022-07-14 15:00:12,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:12,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:12,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:12,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:12,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:12,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:12,943 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 [2022-07-14 15:00:12,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:12,985 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 [2022-07-14 15:00:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:12,987 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) [2022-07-14 15:00:12,988 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 [2022-07-14 15:00:12,989 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 [2022-07-14 15:00:12,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:12,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:12,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:12,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:12,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:12,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:12,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:13,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:13,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,025 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) [2022-07-14 15:00:13,025 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 [2022-07-14 15:00:13,026 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 [2022-07-14 15:00:13,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:13,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:13,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:13,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,063 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 [2022-07-14 15:00:13,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,064 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) [2022-07-14 15:00:13,065 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 [2022-07-14 15:00:13,066 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 [2022-07-14 15:00:13,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:13,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:13,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:13,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,116 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 [2022-07-14 15:00:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,117 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) [2022-07-14 15:00:13,118 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 [2022-07-14 15:00:13,119 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 [2022-07-14 15:00:13,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:13,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:13,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:13,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,160 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) [2022-07-14 15:00:13,161 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 [2022-07-14 15:00:13,162 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 [2022-07-14 15:00:13,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:13,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:13,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:13,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,201 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 [2022-07-14 15:00:13,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,202 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) [2022-07-14 15:00:13,211 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 [2022-07-14 15:00:13,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,218 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 [2022-07-14 15:00:13,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:13,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:13,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,244 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 [2022-07-14 15:00:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,249 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) [2022-07-14 15:00:13,249 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 [2022-07-14 15:00:13,250 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 [2022-07-14 15:00:13,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:13,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:13,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:13,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:13,290 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 [2022-07-14 15:00:13,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,292 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) [2022-07-14 15:00:13,293 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 [2022-07-14 15:00:13,294 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 [2022-07-14 15:00:13,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:13,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:13,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:13,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:13,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:13,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:13,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:13,393 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-14 15:00:13,394 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-07-14 15:00:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,408 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) [2022-07-14 15:00:13,409 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 [2022-07-14 15:00:13,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:13,501 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:00:13,501 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:13,502 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1, ULTIMATE.start_test_fun_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1 - 4*ULTIMATE.start_test_fun_~i~0#1 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2022-07-14 15:00:13,523 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 [2022-07-14 15:00:13,544 INFO L293 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-07-14 15:00:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:13,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:00:13,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:13,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:00:13,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:13,667 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 [2022-07-14 15:00:13,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 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) [2022-07-14 15:00:13,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. 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 18 states and 26 transitions. Complement of second has 4 states. [2022-07-14 15:00:13,708 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 [2022-07-14 15:00:13,709 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) [2022-07-14 15:00:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-14 15:00:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-14 15:00:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-14 15:00:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-14 15:00:13,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:13,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2022-07-14 15:00:13,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:13,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2022-07-14 15:00:13,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:00:13,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-14 15:00:13,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2022-07-14 15:00:13,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:13,716 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-14 15:00:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2022-07-14 15:00:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-14 15:00:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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) [2022-07-14 15:00:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2022-07-14 15:00:13,718 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-14 15:00:13,718 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-14 15:00:13,719 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:00:13,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2022-07-14 15:00:13,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:13,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:13,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:13,720 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:00:13,720 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:00:13,720 INFO L752 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 151#L567 assume !(main_~array_size~0#1 < 1); 152#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 153#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 142#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 139#L558-2 [2022-07-14 15:00:13,720 INFO L754 eck$LassoCheckResult]: Loop: 139#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 148#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 139#L558-2 [2022-07-14 15:00:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-07-14 15:00:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66583350] [2022-07-14 15:00:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-07-14 15:00:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:13,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254765372] [2022-07-14 15:00:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:13,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:13,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754280838] [2022-07-14 15:00:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,762 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:13,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 15:00:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2022-07-14 15:00:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:13,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566774086] [2022-07-14 15:00:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:13,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:13,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089584349] [2022-07-14 15:00:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,820 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:13,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 15:00:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:13,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:00:13,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:13,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-14 15:00:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:13,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:00:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566774086] [2022-07-14 15:00:13,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 15:00:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089584349] [2022-07-14 15:00:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089584349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:13,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:13,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:00:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890435955] [2022-07-14 15:00:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:00:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:00:13,927 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-07-14 15:00:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:13,951 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-07-14 15:00:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:00:13,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-07-14 15:00:13,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:13,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-07-14 15:00:13,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-14 15:00:13,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-14 15:00:13,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-14 15:00:13,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:13,953 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:00:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-14 15:00:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-14 15:00:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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) [2022-07-14 15:00:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-14 15:00:13,955 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-14 15:00:13,955 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-14 15:00:13,955 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:00:13,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-14 15:00:13,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:13,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:13,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:13,956 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:13,956 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:00:13,957 INFO L752 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 222#L567 assume !(main_~array_size~0#1 < 1); 223#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 224#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 212#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 208#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 209#L558-2 [2022-07-14 15:00:13,957 INFO L754 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 219#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 209#L558-2 [2022-07-14 15:00:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2022-07-14 15:00:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:13,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294996087] [2022-07-14 15:00:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:13,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2022-07-14 15:00:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61464936] [2022-07-14 15:00:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:13,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887403630] [2022-07-14 15:00:13,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:00:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:13,988 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:13,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 15:00:14,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 15:00:14,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:00:14,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:14,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2022-07-14 15:00:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:14,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730155699] [2022-07-14 15:00:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:14,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:14,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009923567] [2022-07-14 15:00:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 15:00:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:14,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:14,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:14,218 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 [2022-07-14 15:00:14,407 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:14,407 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:14,407 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:14,407 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:14,408 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:14,408 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:14,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:14,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration4_Lasso [2022-07-14 15:00:14,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:14,408 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:14,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:14,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:14,745 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:14,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,750 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) [2022-07-14 15:00:14,776 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 [2022-07-14 15:00:14,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:14,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:14,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:14,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:14,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:14,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:14,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:14,788 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 [2022-07-14 15:00:14,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:14,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:14,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,813 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) [2022-07-14 15:00:14,814 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 [2022-07-14 15:00:14,826 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 [2022-07-14 15:00:14,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:14,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:14,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:14,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:14,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:14,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:14,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:14,879 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 [2022-07-14 15:00:14,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,882 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) [2022-07-14 15:00:14,884 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 [2022-07-14 15:00:14,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 [2022-07-14 15:00:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:14,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:14,923 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 [2022-07-14 15:00:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,924 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) [2022-07-14 15:00:14,925 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 [2022-07-14 15:00:14,926 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 [2022-07-14 15:00:14,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:14,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:14,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:14,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:14,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:14,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:14,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:14,983 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 [2022-07-14 15:00:14,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:14,985 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) [2022-07-14 15:00:14,986 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 [2022-07-14 15:00:14,988 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 [2022-07-14 15:00:14,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:14,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:14,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:14,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:14,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:14,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:15,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,027 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) [2022-07-14 15:00:15,028 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 [2022-07-14 15:00:15,029 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 [2022-07-14 15:00:15,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:15,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:15,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:15,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:15,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:15,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:15,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:15,091 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 [2022-07-14 15:00:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,093 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) [2022-07-14 15:00:15,094 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 [2022-07-14 15:00:15,095 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 [2022-07-14 15:00:15,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:15,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:15,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:15,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:15,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:15,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:15,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:15,159 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 [2022-07-14 15:00:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,161 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) [2022-07-14 15:00:15,162 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 [2022-07-14 15:00:15,163 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 [2022-07-14 15:00:15,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:15,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:15,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:15,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:15,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:15,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:15,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:15,195 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 15:00:15,195 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-14 15:00:15,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:15,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,196 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) [2022-07-14 15:00:15,198 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 [2022-07-14 15:00:15,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:15,215 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:00:15,215 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:15,216 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2 Supporting invariants [] [2022-07-14 15:00:15,233 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 [2022-07-14 15:00:15,239 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-14 15:00:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:15,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:00:15,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:15,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:00:15,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:15,285 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 [2022-07-14 15:00:15,285 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 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) [2022-07-14 15:00:15,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. 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) Result 40 states and 54 transitions. Complement of second has 7 states. [2022-07-14 15:00:15,298 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 [2022-07-14 15:00:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-07-14 15:00:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-07-14 15:00:15,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-14 15:00:15,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:15,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-14 15:00:15,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:15,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-14 15:00:15,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:15,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2022-07-14 15:00:15,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-14 15:00:15,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2022-07-14 15:00:15,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:00:15,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:00:15,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2022-07-14 15:00:15,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:15,302 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-14 15:00:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2022-07-14 15:00:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-14 15:00:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 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) [2022-07-14 15:00:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-07-14 15:00:15,304 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-07-14 15:00:15,304 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-07-14 15:00:15,304 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:00:15,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2022-07-14 15:00:15,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:15,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:15,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:15,305 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:15,305 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:00:15,305 INFO L752 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 347#L567 assume !(main_~array_size~0#1 < 1); 348#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 349#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 350#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 329#L555 assume test_fun_#t~mem4#1 < 0;havoc test_fun_#t~mem4#1;test_fun_~res~0#1 := 0; 330#L558-2 [2022-07-14 15:00:15,306 INFO L754 eck$LassoCheckResult]: Loop: 330#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 342#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 330#L558-2 [2022-07-14 15:00:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2022-07-14 15:00:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959358285] [2022-07-14 15:00:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2022-07-14 15:00:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675211354] [2022-07-14 15:00:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976625135] [2022-07-14 15:00:15,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:00:15,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,339 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) [2022-07-14 15:00:15,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 15:00:15,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-14 15:00:15,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:00:15,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2022-07-14 15:00:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869466448] [2022-07-14 15:00:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296879452] [2022-07-14 15:00:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,383 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) [2022-07-14 15:00:15,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-14 15:00:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:15,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:00:15,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:15,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-14 15:00:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:15,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:00:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:15,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869466448] [2022-07-14 15:00:15,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 15:00:15,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296879452] [2022-07-14 15:00:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296879452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:15,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:15,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:00:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682751645] [2022-07-14 15:00:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:00:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:00:15,515 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand has 5 states, 4 states have (on average 2.25) 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) [2022-07-14 15:00:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:15,543 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-07-14 15:00:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:00:15,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2022-07-14 15:00:15,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:15,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2022-07-14 15:00:15,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-14 15:00:15,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-14 15:00:15,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-07-14 15:00:15,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:15,546 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-14 15:00:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-07-14 15:00:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-14 15:00:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 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) [2022-07-14 15:00:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-14 15:00:15,548 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-14 15:00:15,548 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-14 15:00:15,548 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:00:15,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-14 15:00:15,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:15,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:15,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:15,549 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:15,549 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:00:15,549 INFO L752 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 450#L567 assume !(main_~array_size~0#1 < 1); 451#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 452#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 435#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 437#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 448#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 453#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 457#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 456#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 454#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 433#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 434#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 438#L558-2 [2022-07-14 15:00:15,549 INFO L754 eck$LassoCheckResult]: Loop: 438#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 446#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 438#L558-2 [2022-07-14 15:00:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2022-07-14 15:00:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997477573] [2022-07-14 15:00:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:15,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:15,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997477573] [2022-07-14 15:00:15,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997477573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:15,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:15,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 15:00:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888083720] [2022-07-14 15:00:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:15,593 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:00:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2022-07-14 15:00:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524347989] [2022-07-14 15:00:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662530120] [2022-07-14 15:00:15,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 15:00:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,599 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) [2022-07-14 15:00:15,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 15:00:15,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 15:00:15,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:00:15,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:15,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:00:15,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:00:15,678 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2022-07-14 15:00:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:15,710 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-14 15:00:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:00:15,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-14 15:00:15,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:15,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2022-07-14 15:00:15,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:00:15,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:00:15,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-07-14 15:00:15,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:15,712 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-14 15:00:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-07-14 15:00:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-07-14 15:00:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 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) [2022-07-14 15:00:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-14 15:00:15,714 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-14 15:00:15,714 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-14 15:00:15,714 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:00:15,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2022-07-14 15:00:15,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:00:15,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:15,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:15,715 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:15,715 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:00:15,715 INFO L752 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 520#L567 assume !(main_~array_size~0#1 < 1); 521#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 522#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 523#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 532#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 524#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 525#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 534#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 529#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 528#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 527#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 526#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 505#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 506#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 510#L558-2 [2022-07-14 15:00:15,716 INFO L754 eck$LassoCheckResult]: Loop: 510#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 516#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 510#L558-2 [2022-07-14 15:00:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2022-07-14 15:00:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583561301] [2022-07-14 15:00:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836073377] [2022-07-14 15:00:15,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,725 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) [2022-07-14 15:00:15,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 15:00:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2022-07-14 15:00:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157065210] [2022-07-14 15:00:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,779 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392588390] [2022-07-14 15:00:15,779 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 15:00:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,781 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) [2022-07-14 15:00:15,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 15:00:15,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 15:00:15,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:00:15,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2022-07-14 15:00:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209757687] [2022-07-14 15:00:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:15,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:00:15,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137741279] [2022-07-14 15:00:15,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:00:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:15,847 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) [2022-07-14 15:00:15,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 15:00:15,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:00:15,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:00:15,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:15,897 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 [2022-07-14 15:00:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:15,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:16,287 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:16,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:16,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:16,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:16,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:16,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:16,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:16,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration7_Lasso [2022-07-14 15:00:16,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:16,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:16,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:16,643 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:16,643 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,645 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2022-07-14 15:00:16,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:00:16,647 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 [2022-07-14 15:00:16,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:16,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:16,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:16,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,677 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2022-07-14 15:00:16,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 15:00:16,679 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 [2022-07-14 15:00:16,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:16,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:16,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:16,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:16,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,719 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2022-07-14 15:00:16,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 15:00:16,726 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 [2022-07-14 15:00:16,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:16,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:16,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,754 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) [2022-07-14 15:00:16,755 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 [2022-07-14 15:00:16,756 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 [2022-07-14 15:00:16,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:16,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:16,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:16,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 15:00:16,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,794 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) [2022-07-14 15:00:16,794 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 [2022-07-14 15:00:16,795 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 [2022-07-14 15:00:16,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:16,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:16,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:16,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,817 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 [2022-07-14 15:00:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,818 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) [2022-07-14 15:00:16,819 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 [2022-07-14 15:00:16,821 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 [2022-07-14 15:00:16,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:16,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:16,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,852 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 [2022-07-14 15:00:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,854 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) [2022-07-14 15:00:16,854 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 [2022-07-14 15:00:16,856 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 [2022-07-14 15:00:16,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:16,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:16,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:16,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:16,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,884 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) [2022-07-14 15:00:16,885 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 [2022-07-14 15:00:16,886 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 [2022-07-14 15:00:16,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:16,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:16,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:16,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:16,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:16,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:16,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:16,910 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 15:00:16,910 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-14 15:00:16,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:16,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:16,912 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) [2022-07-14 15:00:16,912 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 [2022-07-14 15:00:16,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:16,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:00:16,931 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:16,931 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3 Supporting invariants [] [2022-07-14 15:00:16,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:16,955 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-14 15:00:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:16,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:00:16,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:17,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:00:17,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:17,014 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 [2022-07-14 15:00:17,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-07-14 15:00:17,026 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 [2022-07-14 15:00:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-14 15:00:17,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-14 15:00:17,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:17,026 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:00:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:17,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:00:17,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:17,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:00:17,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:17,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:00:17,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-07-14 15:00:17,092 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 [2022-07-14 15:00:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-14 15:00:17,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-14 15:00:17,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:17,093 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:00:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:17,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:00:17,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:17,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:00:17,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:17,147 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:00:17,148 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,158 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Result 39 states and 50 transitions. Complement of second has 6 states. [2022-07-14 15:00:17,158 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 [2022-07-14 15:00:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-14 15:00:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-07-14 15:00:17,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-14 15:00:17,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:17,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2022-07-14 15:00:17,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:17,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2022-07-14 15:00:17,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:17,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2022-07-14 15:00:17,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:00:17,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:00:17,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:00:17,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:00:17,161 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:00:17,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:00:17,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:00:17,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:00:17,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:00:17 BoogieIcfgContainer [2022-07-14 15:00:17,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:00:17,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:00:17,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:00:17,166 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:00:17,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:11" (3/4) ... [2022-07-14 15:00:17,168 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:00:17,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:00:17,168 INFO L158 Benchmark]: Toolchain (without parser) took 6087.39ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 73.7MB in the beginning and 74.3MB in the end (delta: -638.3kB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,168 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:00:17,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.21ms. Allocated memory is still 96.5MB. Free memory was 73.6MB in the beginning and 58.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.61ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,171 INFO L158 Benchmark]: Boogie Preprocessor took 46.14ms. Allocated memory is still 96.5MB. Free memory was 56.4MB in the beginning and 55.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,171 INFO L158 Benchmark]: RCFGBuilder took 325.33ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 71.6MB in the end (delta: -16.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,171 INFO L158 Benchmark]: BuchiAutomizer took 5273.11ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 71.2MB in the beginning and 74.3MB in the end (delta: -3.2MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-07-14 15:00:17,171 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 146.8MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:00:17,172 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.15ms. Allocated memory is still 79.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.21ms. Allocated memory is still 96.5MB. Free memory was 73.6MB in the beginning and 58.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.61ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.14ms. Allocated memory is still 96.5MB. Free memory was 56.4MB in the beginning and 55.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.33ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 71.6MB in the end (delta: -16.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5273.11ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 71.2MB in the beginning and 74.3MB in the end (delta: -3.2MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 146.8MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[a] and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 119 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax110 hnf100 lsp86 ukn70 mio100 lsp49 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:00:17,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:17,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:17,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-14 15:00:17,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-14 15:00:18,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:18,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:18,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-14 15:00:18,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:18,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-14 15:00:19,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:19,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:19,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE