./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_AG313-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/java_AG313-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 2bfa9ea18c3859fb14daaafa2138a5573eef07b7f87afeb019dc7effa80c928b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:39,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:39,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:39,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:39,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:39,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:39,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:39,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:39,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:39,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:39,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:39,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:39,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:39,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:39,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:39,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:39,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:39,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:39,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:39,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:39,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:39,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:39,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:39,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:39,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:39,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:39,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:39,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:39,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:39,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:39,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:39,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:39,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:39,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:39,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:39,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:39,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:39,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:39,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:39,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:39,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:39,639 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:39,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:39,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:39,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:39,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:39,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:39,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:39,664 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:39,664 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:39,664 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:39,664 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:39,665 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:39,665 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:39,665 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:39,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:39,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:39,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:39,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:39,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:39,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:39,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:39,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:39,668 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:39,668 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 -> 2bfa9ea18c3859fb14daaafa2138a5573eef07b7f87afeb019dc7effa80c928b [2022-02-21 03:32:39,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:39,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:39,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:39,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:39,907 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:39,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2022-02-21 03:32:39,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219e2a6b2/c2e2088e216c4ffb83fdea863b0602f0/FLAGea2ec6878 [2022-02-21 03:32:40,325 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:40,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2022-02-21 03:32:40,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219e2a6b2/c2e2088e216c4ffb83fdea863b0602f0/FLAGea2ec6878 [2022-02-21 03:32:40,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219e2a6b2/c2e2088e216c4ffb83fdea863b0602f0 [2022-02-21 03:32:40,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:40,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:40,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:40,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:40,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:40,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:40" (1/1) ... [2022-02-21 03:32:40,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fea64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:40, skipping insertion in model container [2022-02-21 03:32:40,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:40" (1/1) ... [2022-02-21 03:32:40,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:40,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:40,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:40,781 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:40,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:40,879 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:40,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:40 WrapperNode [2022-02-21 03:32:40,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:40,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:40,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:40,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:40,893 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:40" (1/1) ... [2022-02-21 03:32:40,923 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:40" (1/1) ... [2022-02-21 03:32:40,963 INFO L137 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-02-21 03:32:40,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:40,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:40,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:40,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:40,976 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:40" (1/1) ... [2022-02-21 03:32:40,976 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:40" (1/1) ... [2022-02-21 03:32:40,997 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:40" (1/1) ... [2022-02-21 03:32:40,997 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:40" (1/1) ... [2022-02-21 03:32:41,000 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:40" (1/1) ... [2022-02-21 03:32:41,007 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:40" (1/1) ... [2022-02-21 03:32:41,008 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:40" (1/1) ... [2022-02-21 03:32:41,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:41,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:41,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:41,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:41,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:40" (1/1) ... [2022-02-21 03:32:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,084 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:41,117 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:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:41,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:41,238 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:41,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:41,382 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:41,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:41,387 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:32:41,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:41 BoogieIcfgContainer [2022-02-21 03:32:41,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:41,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:41,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:41,393 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:41,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:41,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:40" (1/3) ... [2022-02-21 03:32:41,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@678b385a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:41, skipping insertion in model container [2022-02-21 03:32:41,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:41,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:40" (2/3) ... [2022-02-21 03:32:41,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@678b385a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:41, skipping insertion in model container [2022-02-21 03:32:41,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:41,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:41" (3/3) ... [2022-02-21 03:32:41,396 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca.i [2022-02-21 03:32:41,424 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:41,425 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:41,425 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:41,425 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:41,425 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:41,425 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:41,425 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:41,425 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:41,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-02-21 03:32:41,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:41,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:41,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:41,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:32:41,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:41,461 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:41,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-02-21 03:32:41,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:41,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:41,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:41,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:32:41,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:41,470 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_quot } true;quot_#in~x#1, quot_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc quot_#res#1;havoc quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset, quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset, quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset, quot_#t~mem5#1, quot_#t~mem9#1, quot_#t~mem10#1, quot_#t~mem11#1, quot_#t~mem6#1, quot_#t~mem7#1, quot_#t~short8#1, quot_#t~mem12#1, quot_~x#1, quot_~y#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, quot_~i~0#1.base, quot_~i~0#1.offset;quot_~x#1 := quot_#in~x#1;quot_~y#1 := quot_#in~y#1;call quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset := quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset;call quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset := quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset;call quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);quot_~i~0#1.base, quot_~i~0#1.offset := quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset;call write~int(quot_~x#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call write~int(quot_~y#1, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(0, quot_~i~0#1.base, quot_~i~0#1.offset, 4);call quot_#t~mem5#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4); 5#L555true assume !(0 == quot_#t~mem5#1);havoc quot_#t~mem5#1; 3#L556-5true [2022-02-21 03:32:41,471 INFO L793 eck$LassoCheckResult]: Loop: 3#L556-5true call quot_#t~mem6#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; 10#L556-1true assume !quot_#t~short8#1; 8#L556-3true assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; 3#L556-5true [2022-02-21 03:32:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-02-21 03:32:41,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:41,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902995167] [2022-02-21 03:32:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:41,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:41,684 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2022-02-21 03:32:41,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:41,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231966941] [2022-02-21 03:32:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} call quot_#t~mem6#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; {17#true} is VALID [2022-02-21 03:32:41,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume !quot_#t~short8#1; {19#(not |ULTIMATE.start_quot_#t~short8#1|)} is VALID [2022-02-21 03:32:41,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(not |ULTIMATE.start_quot_#t~short8#1|)} assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; {18#false} is VALID [2022-02-21 03:32:41,776 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:41,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:41,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231966941] [2022-02-21 03:32:41,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231966941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:41,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:41,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:41,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932584403] [2022-02-21 03:32:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:41,781 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:41,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:32:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:32:41,806 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:41,840 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:32:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:32:41,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:41,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:41,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2022-02-21 03:32:41,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:41,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2022-02-21 03:32:41,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:32:41,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:32:41,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2022-02-21 03:32:41,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:41,852 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2022-02-21 03:32:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2022-02-21 03:32:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2022-02-21 03:32:41,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:41,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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:41,868 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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:41,869 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:41,870 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2022-02-21 03:32:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2022-02-21 03:32:41,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:41,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:41,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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 6 states and 6 transitions. [2022-02-21 03:32:41,872 INFO L87 Difference]: Start difference. First operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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 6 states and 6 transitions. [2022-02-21 03:32:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:41,872 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2022-02-21 03:32:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2022-02-21 03:32:41,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:41,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:41,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:41,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2022-02-21 03:32:41,875 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2022-02-21 03:32:41,875 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2022-02-21 03:32:41,875 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:41,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2022-02-21 03:32:41,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:41,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:41,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:41,876 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:32:41,877 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:41,877 INFO L791 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 36#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_quot } true;quot_#in~x#1, quot_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc quot_#res#1;havoc quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset, quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset, quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset, quot_#t~mem5#1, quot_#t~mem9#1, quot_#t~mem10#1, quot_#t~mem11#1, quot_#t~mem6#1, quot_#t~mem7#1, quot_#t~short8#1, quot_#t~mem12#1, quot_~x#1, quot_~y#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, quot_~i~0#1.base, quot_~i~0#1.offset;quot_~x#1 := quot_#in~x#1;quot_~y#1 := quot_#in~y#1;call quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset := quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset;call quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset := quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset;call quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);quot_~i~0#1.base, quot_~i~0#1.offset := quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset;call write~int(quot_~x#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call write~int(quot_~y#1, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(0, quot_~i~0#1.base, quot_~i~0#1.offset, 4);call quot_#t~mem5#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4); 34#L555 assume !(0 == quot_#t~mem5#1);havoc quot_#t~mem5#1; 32#L556-5 [2022-02-21 03:32:41,877 INFO L793 eck$LassoCheckResult]: Loop: 32#L556-5 call quot_#t~mem6#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; 33#L556-1 assume quot_#t~short8#1;call quot_#t~mem7#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem7#1 > 0; 37#L556-3 assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; 32#L556-5 [2022-02-21 03:32:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2022-02-21 03:32:41,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:41,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062210047] [2022-02-21 03:32:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:41,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:41,965 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2022-02-21 03:32:41,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:41,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674023032] [2022-02-21 03:32:41,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:41,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:41,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,009 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2022-02-21 03:32:42,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:42,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720402692] [2022-02-21 03:32:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,093 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:42,737 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:42,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:42,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:42,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:42,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:42,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:42,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:42,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:42,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca.i_Iteration2_Lasso [2022-02-21 03:32:42,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:42,739 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:42,752 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:42,757 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:42,760 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:42,762 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:42,764 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:42,766 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:42,768 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:42,770 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:42,772 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:42,774 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:43,466 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:43,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:43,470 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:43,472 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:43,484 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:43,486 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:43,488 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:44,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:44,042 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,045 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:44,051 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:44,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,062 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:44,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,089 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-02-21 03:32:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,090 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:44,094 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:44,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,106 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:44,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,151 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:44,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,153 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:44,154 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:44,155 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:44,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,209 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:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,211 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:44,230 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:44,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,240 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:44,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,268 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-02-21 03:32:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,270 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:44,271 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:44,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:44,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,323 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:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,325 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:44,326 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:44,327 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:44,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,362 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:44,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,364 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:44,365 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:44,366 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:44,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,412 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:44,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,413 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:44,414 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:44,415 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:44,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,455 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:44,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,457 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:44,458 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:44,459 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:44,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:44,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:44,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:44,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,503 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:44,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,504 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:44,519 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:44,520 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:44,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,563 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 [2022-02-21 03:32:44,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:44,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:32:44,567 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:44,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:44,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:32:44,606 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:44,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:44,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:44,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:32:44,668 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:44,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:44,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,695 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:32:44,698 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:44,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:44,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:44,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:44,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:32:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,727 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-02-21 03:32:44,728 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-02-21 03:32:44,730 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:44,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:44,744 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:32:44,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:44,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:44,755 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 03:32:44,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:44,769 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:44,800 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:32:44,800 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:32:44,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:44,843 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-02-21 03:32:44,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:44,889 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-02-21 03:32:44,924 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:44,924 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:44,925 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0#1.base) ULTIMATE.start_quot_~x_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0#1.base) ULTIMATE.start_quot_~x_ref~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:32:44,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:32:45,089 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:32:45,095 INFO L390 LassoCheck]: Loop: "call quot_#t~mem6#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0;" "assume quot_#t~short8#1;call quot_#t~mem7#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem7#1 > 0;" "assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1;" [2022-02-21 03:32:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:45,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:32:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:45,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:45,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-21 03:32:45,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {59#unseeded} is VALID [2022-02-21 03:32:45,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_quot } true;quot_#in~x#1, quot_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc quot_#res#1;havoc quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset, quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset, quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset, quot_#t~mem5#1, quot_#t~mem9#1, quot_#t~mem10#1, quot_#t~mem11#1, quot_#t~mem6#1, quot_#t~mem7#1, quot_#t~short8#1, quot_#t~mem12#1, quot_~x#1, quot_~y#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, quot_~i~0#1.base, quot_~i~0#1.offset;quot_~x#1 := quot_#in~x#1;quot_~y#1 := quot_#in~y#1;call quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset := quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset;call quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset := quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset;call quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);quot_~i~0#1.base, quot_~i~0#1.offset := quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset;call write~int(quot_~x#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call write~int(quot_~y#1, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(0, quot_~i~0#1.base, quot_~i~0#1.offset, 4);call quot_#t~mem5#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4); {205#(and unseeded (or (= |ULTIMATE.start_quot_#t~mem5#1| 0) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|))))} is VALID [2022-02-21 03:32:45,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#(and unseeded (or (= |ULTIMATE.start_quot_#t~mem5#1| 0) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|))))} assume !(0 == quot_#t~mem5#1);havoc quot_#t~mem5#1; {193#(and unseeded (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} is VALID [2022-02-21 03:32:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:45,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:45,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:45,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} call quot_#t~mem6#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; {209#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (not |ULTIMATE.start_quot_#t~short8#1|)) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} is VALID [2022-02-21 03:32:45,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (not |ULTIMATE.start_quot_#t~short8#1|)) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} assume quot_#t~short8#1;call quot_#t~mem7#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem7#1 > 0; {213#(and (<= (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~y_ref~0#1.base|) |ULTIMATE.start_quot_~y_ref~0#1.offset|)) (not |ULTIMATE.start_quot_#t~short8#1|)) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} is VALID [2022-02-21 03:32:45,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(and (<= (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_quot_~y_ref~0#1.base|) |ULTIMATE.start_quot_~y_ref~0#1.offset|)) (not |ULTIMATE.start_quot_#t~short8#1|)) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; {196#(and (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_quot_~x_ref~0#1.base|) |ULTIMATE.start_quot_~x_ref~0#1.offset|))) unseeded) (not (= |ULTIMATE.start_quot_~i~0#1.base| |ULTIMATE.start_quot_~x_ref~0#1.base|)))} is VALID [2022-02-21 03:32:45,658 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:45,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:45,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:32:45,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 9 states and 10 transitions. Complement of second has 7 states. [2022-02-21 03:32:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:45,725 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:45,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. cyclomatic complexity: 1 [2022-02-21 03:32:45,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:45,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:45,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:45,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:45,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:45,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:32:45,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:45,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:45,727 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 6 transitions. cyclomatic complexity: 1 [2022-02-21 03:32:45,728 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:45,728 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:45,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:45,729 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2022-02-21 03:32:45,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2022-02-21 03:32:45,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:45,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:45,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:45,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:32:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 letters. Loop has 6 letters. [2022-02-21 03:32:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:32:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 3 letters. [2022-02-21 03:32:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:32:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,736 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2022-02-21 03:32:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:32:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:45,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2022-02-21 03:32:45,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:45,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2022-02-21 03:32:45,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:45,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:45,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:45,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:45,740 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:45,740 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:45,740 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:45,740 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:45,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:45,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:45,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:45,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:45 BoogieIcfgContainer [2022-02-21 03:32:45,746 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:45,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:45,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:45,747 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:45,747 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:41" (3/4) ... [2022-02-21 03:32:45,749 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:45,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:45,750 INFO L158 Benchmark]: Toolchain (without parser) took 5388.33ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 99.2MB in the beginning and 72.5MB in the end (delta: 26.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:45,750 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:45,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.71ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 103.6MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:45,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.32ms. Allocated memory is still 138.4MB. Free memory was 103.6MB in the beginning and 101.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:45,751 INFO L158 Benchmark]: Boogie Preprocessor took 59.81ms. Allocated memory is still 138.4MB. Free memory was 101.4MB in the beginning and 99.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:45,752 INFO L158 Benchmark]: RCFGBuilder took 356.74ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 86.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 03:32:45,752 INFO L158 Benchmark]: BuchiAutomizer took 4357.22ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 86.2MB in the beginning and 72.5MB in the end (delta: 13.7MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:45,752 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 186.6MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:45,769 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- 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.14ms. Allocated memory is still 138.4MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.71ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 103.6MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.32ms. Allocated memory is still 138.4MB. Free memory was 103.6MB in the beginning and 101.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.81ms. Allocated memory is still 138.4MB. Free memory was 101.4MB in the beginning and 99.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 356.74ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 86.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4357.22ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 86.2MB in the beginning and 72.5MB in the end (delta: 13.7MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 186.6MB. Free memory is still 72.5MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 14 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital331 mio100 ax105 hnf100 lsp93 ukn59 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 198ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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:45,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:32:45,993 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