./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/genady-alloca.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 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:38,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:38,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:38,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:38,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:38,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:38,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:38,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:38,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:38,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:38,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:38,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:38,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:38,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:38,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:38,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:38,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:38,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:38,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:38,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:38,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:38,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:38,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:38,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:38,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:38,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:38,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:38,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:38,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:38,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:38,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:38,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:38,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:38,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:38,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:38,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:38,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:38,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:38,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:38,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:38,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:38,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:38,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:38,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:38,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:38,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:38,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:38,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:38,427 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:38,427 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:38,427 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:38,427 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:38,428 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:38,428 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:38,429 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:38,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:38,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:38,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:38,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:38,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:38,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:38,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:38,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:38,430 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:38,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:38,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:38,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:38,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:38,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:38,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:38,432 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:38,432 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 -> 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 [2022-02-21 03:32:38,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:38,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:38,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:38,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:38,699 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:38,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2022-02-21 03:32:38,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6209e67/c743f1c4a2f94bf797d4a8ca35a9240d/FLAGf3bff313c [2022-02-21 03:32:39,182 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:39,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2022-02-21 03:32:39,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6209e67/c743f1c4a2f94bf797d4a8ca35a9240d/FLAGf3bff313c [2022-02-21 03:32:39,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6209e67/c743f1c4a2f94bf797d4a8ca35a9240d [2022-02-21 03:32:39,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:39,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:39,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:39,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:39,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:39,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5724d62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39, skipping insertion in model container [2022-02-21 03:32:39,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:39,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:39,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:39,589 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:39,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:39,666 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:39,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39 WrapperNode [2022-02-21 03:32:39,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:39,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:39,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:39,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:39,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,721 INFO L137 Inliner]: procedures = 109, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-02-21 03:32:39,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:39,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:39,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:39,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:39,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:39,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:39,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:39,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:39,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (1/1) ... [2022-02-21 03:32:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,794 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-02-21 03:32:39,821 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-02-21 03:32:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:39,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:39,936 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:39,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:40,099 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:40,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:40,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:32:40,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:40 BoogieIcfgContainer [2022-02-21 03:32:40,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:40,108 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:40,108 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:40,111 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:40,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:40,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:39" (1/3) ... [2022-02-21 03:32:40,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529001f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:40, skipping insertion in model container [2022-02-21 03:32:40,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:40,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:39" (2/3) ... [2022-02-21 03:32:40,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529001f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:40, skipping insertion in model container [2022-02-21 03:32:40,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:40,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:40" (3/3) ... [2022-02-21 03:32:40,115 INFO L388 chiAutomizerObserver]: Analyzing ICFG genady-alloca.i [2022-02-21 03:32:40,152 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:40,152 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:40,152 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:40,153 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:40,153 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:40,153 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:40,153 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:40,153 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:40,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-02-21 03:32:40,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:40,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,185 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:40,186 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:40,187 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:40,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-02-21 03:32:40,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:40,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:40,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:40,198 INFO L791 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(1, main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(10000, main_~i~0#1.base, main_~i~0#1.offset, 4); 7#L550-4true [2022-02-21 03:32:40,199 INFO L793 eck$LassoCheckResult]: Loop: 7#L550-4true call main_#t~mem6#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 10#L550-1true assume !!(main_#t~mem6#1 - main_#t~mem7#1 >= 1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 8#L550-3true call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post5#1 := main_#t~mem4#1;call write~int(main_#t~post5#1 - 1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem4#1;havoc main_#t~post5#1; 7#L550-4true [2022-02-21 03:32:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:40,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:40,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594340308] [2022-02-21 03:32:40,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,442 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2022-02-21 03:32:40,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:40,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724197782] [2022-02-21 03:32:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2022-02-21 03:32:40,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:40,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841097027] [2022-02-21 03:32:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:40,639 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:41,079 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:41,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:41,080 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:41,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:41,081 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:41,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:41,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:41,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: genady-alloca.i_Iteration1_Lasso [2022-02-21 03:32:41,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:41,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:41,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:41,885 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:41,889 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:41,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,895 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-02-21 03:32:41,902 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-02-21 03:32:41,903 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-02-21 03:32:41,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:41,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:41,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:41,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:32:41,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,951 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-02-21 03:32:41,952 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-02-21 03:32:41,953 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-02-21 03:32:41,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:41,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:41,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:41,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,984 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-02-21 03:32:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,985 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-02-21 03:32:41,996 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-02-21 03:32:42,004 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-02-21 03:32:42,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:42,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:42,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,048 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-02-21 03:32:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,050 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-02-21 03:32:42,052 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-02-21 03:32:42,052 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-02-21 03:32:42,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:42,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:42,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:32:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,108 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-02-21 03:32:42,109 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-02-21 03:32:42,111 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-02-21 03:32:42,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:42,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:42,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:42,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,163 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-02-21 03:32:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,164 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-02-21 03:32:42,165 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-02-21 03:32:42,168 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-02-21 03:32:42,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:42,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:42,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,233 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-02-21 03:32:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,235 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-02-21 03:32:42,240 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-02-21 03:32:42,241 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-02-21 03:32:42,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:42,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:42,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:42,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,271 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-02-21 03:32:42,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,273 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-02-21 03:32:42,274 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-02-21 03:32:42,275 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-02-21 03:32:42,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:42,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:42,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:42,321 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-02-21 03:32:42,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,322 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-02-21 03:32:42,323 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-02-21 03:32:42,324 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-02-21 03:32:42,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:42,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:42,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:42,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:42,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:42,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:42,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:42,397 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:32:42,397 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:32:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:42,415 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-02-21 03:32:42,456 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-02-21 03:32:42,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:42,481 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:42,481 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:42,482 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:32:42,507 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-02-21 03:32:42,580 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:32:42,586 INFO L390 LassoCheck]: Loop: "call main_#t~mem6#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !!(main_#t~mem6#1 - main_#t~mem7#1 >= 1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1;" "call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post5#1 := main_#t~mem4#1;call write~int(main_#t~post5#1 - 1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem4#1;havoc main_#t~post5#1;" [2022-02-21 03:32:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {19#unseeded} is VALID [2022-02-21 03:32:42,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(1, main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(10000, main_~i~0#1.base, main_~i~0#1.offset, 4); {19#unseeded} is VALID [2022-02-21 03:32:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,926 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-02-21 03:32:42,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 39 [2022-02-21 03:32:42,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem6#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); {95#(and (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1|))} is VALID [2022-02-21 03:32:42,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#(and (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1|))} assume !!(main_#t~mem6#1 - main_#t~mem7#1 >= 1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {99#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) oldRank0)) (or (not (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (not (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|))) (<= 1 oldRank0))} is VALID [2022-02-21 03:32:42,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) oldRank0)) (or (not (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|)) (not (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|))) (<= 1 oldRank0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post5#1 := main_#t~mem4#1;call write~int(main_#t~post5#1 - 1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem4#1;havoc main_#t~post5#1; {87#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))))} is VALID [2022-02-21 03:32:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:43,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-21 03:32:43,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:43,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,026 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:43,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-21 03:32:43,098 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Result 21 states and 23 transitions. Complement of second has 7 states. [2022-02-21 03:32:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:43,100 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:43,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-02-21 03:32:43,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:43,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:43,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:43,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-21 03:32:43,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:43,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:43,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:43,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2022-02-21 03:32:43,114 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:43,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:43,115 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-02-21 03:32:43,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:43,117 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:43,118 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-21 03:32:43,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:43,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:43,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 23 transitions. cyclomatic complexity: 3 [2022-02-21 03:32:43,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. cyclomatic complexity: 3 [2022-02-21 03:32:43,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:43,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:43,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:43,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:43,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:43,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:43,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:43,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:43,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:43,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:43,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:43,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:43,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:43,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:43,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:43,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:43,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:43,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:43,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:43,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:43,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,136 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-21 03:32:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-21 03:32:43,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:43,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:43,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:43,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:43,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. cyclomatic complexity: 3 [2022-02-21 03:32:43,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:43,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2022-02-21 03:32:43,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:43,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:43,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:43,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:43,168 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:43,168 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:43,168 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:43,168 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:43,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:43,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:43,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:43,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:43 BoogieIcfgContainer [2022-02-21 03:32:43,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:43,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:43,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:43,174 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:43,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:40" (3/4) ... [2022-02-21 03:32:43,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:43,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:43,178 INFO L158 Benchmark]: Toolchain (without parser) took 3960.41ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 57.7MB in the beginning and 88.7MB in the end (delta: -31.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,178 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.79ms. Allocated memory is still 94.4MB. Free memory was 57.3MB in the beginning and 62.0MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:43,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 60.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,180 INFO L158 Benchmark]: Boogie Preprocessor took 42.77ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 58.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,180 INFO L158 Benchmark]: RCFGBuilder took 340.89ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 47.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:43,181 INFO L158 Benchmark]: BuchiAutomizer took 3065.26ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 89.6MB in the end (delta: -41.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,181 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 115.3MB. Free memory was 89.6MB in the beginning and 88.7MB in the end (delta: 883.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:43,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-02-21 03:32:43,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.79ms. Allocated memory is still 94.4MB. Free memory was 57.3MB in the beginning and 62.0MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 60.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.77ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 58.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 340.89ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 47.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3065.26ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 89.6MB in the end (delta: -41.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 115.3MB. Free memory was 89.6MB in the beginning and 88.7MB in the end (delta: 883.4kB). 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[i][i] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital200 mio100 ax109 hnf100 lsp88 ukn61 mio100 lsp40 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:32:43,238 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