./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.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-recursive-malloc/rec_malloc_ex11.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 a88778e925af9c1a64b7e94f7ff093b6408bd8b2e5fbc09d91ee3e64112df49e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:39,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:39,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:39,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:39,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:39,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:39,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:39,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:39,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:39,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:39,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:39,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:39,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:39,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:39,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:39,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:39,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:39,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:39,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:39,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:39,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:39,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:39,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:39,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:39,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:39,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:39,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:39,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:39,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:39,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:39,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:39,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:39,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:39,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:39,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:39,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:39,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:39,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:39,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:39,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:39,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:39,678 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:35:39,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:39,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:39,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:39,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:39,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:39,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:39,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:39,697 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:39,697 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:39,697 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:39,697 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:39,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:39,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:39,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:39,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:39,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:39,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:39,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:39,701 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:39,701 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 -> a88778e925af9c1a64b7e94f7ff093b6408bd8b2e5fbc09d91ee3e64112df49e [2022-02-21 03:35:39,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:39,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:39,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:39,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:39,931 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:39,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2022-02-21 03:35:40,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ff9b35/4f086037b42846c197219071598387cf/FLAG1e64453a9 [2022-02-21 03:35:40,336 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:40,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2022-02-21 03:35:40,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ff9b35/4f086037b42846c197219071598387cf/FLAG1e64453a9 [2022-02-21 03:35:40,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030ff9b35/4f086037b42846c197219071598387cf [2022-02-21 03:35:40,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:40,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:40,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:40,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:40,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:40,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef46ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40, skipping insertion in model container [2022-02-21 03:35:40,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:40,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:40,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:40,510 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:40,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:40,541 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:40,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40 WrapperNode [2022-02-21 03:35:40,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:40,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:40,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:40,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:40,560 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:35:40" (1/1) ... [2022-02-21 03:35:40,564 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:35:40" (1/1) ... [2022-02-21 03:35:40,576 INFO L137 Inliner]: procedures = 11, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-21 03:35:40,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:40,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:40,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:40,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:40,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:40,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:40,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:40,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:40,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (1/1) ... [2022-02-21 03:35:40,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:40,648 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:35:40,666 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:35:40,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:40,692 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:40,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:40,744 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:40,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:40,920 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:40,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:40,926 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:40,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:40 BoogieIcfgContainer [2022-02-21 03:35:40,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:40,928 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:40,928 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:40,931 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:40,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:40" (1/3) ... [2022-02-21 03:35:40,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@362d9646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:40, skipping insertion in model container [2022-02-21 03:35:40,932 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:40" (2/3) ... [2022-02-21 03:35:40,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@362d9646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:40, skipping insertion in model container [2022-02-21 03:35:40,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:40,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:40" (3/3) ... [2022-02-21 03:35:40,934 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11.i [2022-02-21 03:35:40,972 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:40,972 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:40,972 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:40,972 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:40,972 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:40,972 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:40,973 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:40,973 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:40,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:41,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:41,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:41,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:41,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:41,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:41,016 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:41,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:41,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:41,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:41,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:41,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:41,023 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:41,034 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 14#L28-3true [2022-02-21 03:35:41,034 INFO L793 eck$LassoCheckResult]: Loop: 14#L28-3true call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 12#L28-1true assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 8#L32true assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 9#L36true call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 13#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 11#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 18#recFINALtrue assume true; 16#recEXITtrue >#44#return; 15#L36-1true assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 10#L36-3true call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 14#L28-3true [2022-02-21 03:35:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:41,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074687364] [2022-02-21 03:35:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,229 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2022-02-21 03:35:41,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10973153] [2022-02-21 03:35:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:35:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:41,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:41,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:41,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:41,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:41,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {24#true} is VALID [2022-02-21 03:35:41,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-21 03:35:41,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} is VALID [2022-02-21 03:35:41,529 INFO L272 TraceCheckUtils]: 3: Hoare triple {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:41,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:41,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:41,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:41,533 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:41,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {25#false} is VALID [2022-02-21 03:35:41,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {25#false} is VALID [2022-02-21 03:35:41,542 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:35:41,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:41,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10973153] [2022-02-21 03:35:41,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10973153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:41,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:41,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:41,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763964199] [2022-02-21 03:35:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:41,548 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:41,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:41,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:41,583 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,810 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:35:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:35:41,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:41,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:41,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-02-21 03:35:41,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:41,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2022-02-21 03:35:41,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:35:41,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:41,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 03:35:41,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:41,841 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 03:35:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:35:41,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:41,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,859 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,860 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,862 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:41,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:41,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:41,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:41,864 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:41,865 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:41,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:41,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:41,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:41,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:35:41,869 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:41,869 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:41,869 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:41,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:41,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:41,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:41,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:41,871 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:41,871 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:41,871 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 64#L28-3 [2022-02-21 03:35:41,871 INFO L793 eck$LassoCheckResult]: Loop: 64#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 69#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 65#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 60#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 63#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 67#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 61#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 63#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 67#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 68#recFINAL assume true; 70#recEXIT >#42#return; 59#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 72#recEXIT >#44#return; 71#L36-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 66#L36-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 64#L28-3 [2022-02-21 03:35:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:35:41,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944944521] [2022-02-21 03:35:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,889 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2022-02-21 03:35:41,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615411418] [2022-02-21 03:35:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:41,992 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2022-02-21 03:35:41,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:41,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926780817] [2022-02-21 03:35:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:42,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:42,114 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:44,286 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:44,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:44,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:44,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:44,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:44,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:44,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:44,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration2_Lasso [2022-02-21 03:35:44,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:44,288 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:44,303 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:35:44,307 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:35:44,309 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:35:44,312 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:35:44,489 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:44,489 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:44,492 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:35:44,494 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:35:44,496 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:35:44,498 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:35:44,500 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:35:44,502 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:35:44,503 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:35:44,505 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:35:44,507 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:35:44,509 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:35:44,867 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:44,870 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,873 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:35:44,875 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:35:44,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:44,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:44,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:44,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:44,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:44,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:44,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:44,887 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:35:44,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:44,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:35:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,925 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:35:44,926 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:35:44,929 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:35:44,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:44,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:44,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:44,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:44,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:44,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:44,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:44,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:44,970 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:35:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,971 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:35:44,974 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:35:44,975 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:35:44,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:44,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:44,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:44,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:44,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:44,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:45,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:45,022 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:35:45,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:45,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:45,024 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:35:45,026 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:35:45,028 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:35:45,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:45,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:45,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:45,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:45,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:45,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:45,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:45,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:45,071 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:35:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:45,073 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:35:45,073 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:35:45,075 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:35:45,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:45,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:45,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:45,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:45,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:45,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:45,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:45,122 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:35:45,122 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:35:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:45,159 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:35:45,178 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:45,186 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:35:45,196 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:45,196 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:45,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:35:45,215 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:35:45,227 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:35:45,232 INFO L390 LassoCheck]: Loop: "call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset);" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0;" "assume true;" >"#42#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#44#return;" "assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1;" "call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1;" [2022-02-21 03:35:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:45,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:45,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {114#unseeded} is VALID [2022-02-21 03:35:45,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {114#unseeded} is VALID [2022-02-21 03:35:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:45,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:35:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:45,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:45,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-21 03:35:45,476 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:35:45,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:35:45,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:35:45,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {140#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:35:45,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {144#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} is VALID [2022-02-21 03:35:45,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:45,625 INFO L272 TraceCheckUtils]: 3: Hoare triple {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume true; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {152#(<= |old(oldRank0)| oldRank0)} {152#(<= |old(oldRank0)| oldRank0)} #42#return; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} #res := #t~ret5;havoc #t~ret5; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume true; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:45,644 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {152#(<= |old(oldRank0)| oldRank0)} {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} #44#return; {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:45,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {186#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} is VALID [2022-02-21 03:35:45,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {132#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))))} is VALID [2022-02-21 03:35:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:35:45,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:45,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:45,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 03:35:45,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:45,793 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:35:45,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 62 states and 73 transitions. Complement of second has 17 states. [2022-02-21 03:35:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:45,870 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:45,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:45,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:45,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:45,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:45,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:45,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:45,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:45,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2022-02-21 03:35:45,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:45,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:45,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:45,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:45,886 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:45,886 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:45,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:45,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:45,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:45,897 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:45,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:45,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:45,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:45,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:45,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:45,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:45,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:45,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:45,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:45,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:45,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:45,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:45,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:45,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:45,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:45,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:45,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:45,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:45,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:45,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:45,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:45,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:45,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:45,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:45,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:45,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:45,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:45,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:45,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:45,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:45,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:45,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:45,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:45,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:45,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:45,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:45,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:45,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:45,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:45,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:45,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:45,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:45,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:45,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:45,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,953 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:35:45,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:45,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:45,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2022-02-21 03:35:45,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:45,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2022-02-21 03:35:45,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 03:35:45,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-02-21 03:35:45,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2022-02-21 03:35:45,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:45,980 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-02-21 03:35:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2022-02-21 03:35:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-02-21 03:35:45,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:45,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:45,986 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:45,986 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:45,987 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:45,996 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:45,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:45,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:45,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:45,998 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:45,998 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:46,002 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:46,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:46,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:46,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:46,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-21 03:35:46,006 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:46,006 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:46,006 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:46,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2022-02-21 03:35:46,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:46,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:46,008 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 286#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 299#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 304#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 321#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 318#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 319#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 327#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 278#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 287#recENTRY [2022-02-21 03:35:46,008 INFO L793 eck$LassoCheckResult]: Loop: 287#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 300#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 279#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 287#recENTRY [2022-02-21 03:35:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2022-02-21 03:35:46,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104234859] [2022-02-21 03:35:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,082 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2022-02-21 03:35:46,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295404259] [2022-02-21 03:35:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,109 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2022-02-21 03:35:46,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436276080] [2022-02-21 03:35:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,183 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:02,780 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:02,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:02,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:02,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:02,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:02,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:02,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:02,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:02,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration3_Lasso [2022-02-21 03:36:02,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:02,782 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:02,787 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:36:02,788 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:36:02,790 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:36:02,791 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:36:02,792 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:36:02,794 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:36:02,795 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:36:02,796 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:36:02,798 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:36:02,799 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:36:02,801 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:36:02,802 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:36:02,805 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:36:02,807 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:36:02,808 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:36:02,809 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:36:02,811 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:36:02,812 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:36:02,813 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:36:03,148 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:36:03,150 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:36:03,158 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:36:03,161 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:36:03,164 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:36:03,166 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:36:03,168 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:36:03,169 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:36:03,171 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:36:03,173 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:36:03,176 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:36:03,177 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:36:03,180 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:36:03,182 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:36:03,184 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:36:03,185 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:36:03,187 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:36:03,847 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:03,847 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:03,849 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:36:03,850 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:36:03,855 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:36:03,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:03,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:03,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:03,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:03,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:03,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:03,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:03,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:03,886 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:36:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:03,888 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:36:03,889 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:36:03,891 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:36:03,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:03,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:03,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:03,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:03,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:03,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:03,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:03,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:03,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:36:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:03,924 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:36:03,926 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:36:03,927 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:36:03,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:03,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:03,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:03,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:03,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:03,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:03,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:03,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:03,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:36:03,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:03,958 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:36:03,985 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:36:03,992 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:36:03,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:03,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:03,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:03,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:03,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:03,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:03,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,018 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:36:04,019 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:36:04,020 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:36:04,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,048 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:36:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,050 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:36:04,052 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:36:04,054 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:36:04,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,079 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:36:04,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,081 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:36:04,082 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:36:04,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:36:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,110 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:36:04,111 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:36:04,112 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:36:04,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,138 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:36:04,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,140 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:36:04,140 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:36:04,143 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:36:04,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,172 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:36:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,174 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:36:04,174 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:36:04,176 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:36:04,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,201 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:36:04,204 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:36:04,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,230 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:36:04,232 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:36:04,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,260 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:36:04,264 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:36:04,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,295 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:36:04,301 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:36:04,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,340 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:36:04,342 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:36:04,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,396 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:36:04,398 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:36:04,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,437 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:04,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:36:04,441 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:36:04,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,474 INFO L229 MonitoredProcess]: Starting monitored process 25 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:36:04,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:36:04,476 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:36:04,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,502 INFO L229 MonitoredProcess]: Starting monitored process 26 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:36:04,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:36:04,505 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:36:04,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,547 INFO L229 MonitoredProcess]: Starting monitored process 27 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:36:04,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:36:04,549 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:36:04,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:36:04,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,582 INFO L229 MonitoredProcess]: Starting monitored process 28 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:36:04,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:36:04,584 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:36:04,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:36:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,610 INFO L229 MonitoredProcess]: Starting monitored process 29 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:36:04,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:36:04,613 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:36:04,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:04,649 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:36:04,649 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:04,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,650 INFO L229 MonitoredProcess]: Starting monitored process 30 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:36:04,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:36:04,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:04,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:04,664 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:04,664 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 + 1 Supporting invariants [] [2022-02-21 03:36:04,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,701 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:36:04,709 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset);" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:36:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:36:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:04,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {610#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {610#unseeded} is VALID [2022-02-21 03:36:04,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {610#unseeded} is VALID [2022-02-21 03:36:04,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:36:04,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {610#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:36:04,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {610#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:36:04,847 INFO L272 TraceCheckUtils]: 5: Hoare triple {610#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {610#unseeded} is VALID [2022-02-21 03:36:04,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#unseeded} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {610#unseeded} is VALID [2022-02-21 03:36:04,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {664#(and (<= 0 rec_~ip~0.offset) unseeded (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:04,849 INFO L272 TraceCheckUtils]: 8: Hoare triple {664#(and (<= 0 rec_~ip~0.offset) unseeded (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {634#(and unseeded (= 0 |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:36:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:05,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:36:05,021 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-21 03:36:05,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-02-21 03:36:05,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#(and (= 0 |rec_#in~op.offset|) (>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) 0)) 1)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {668#(and (= rec_~op.offset 0) (<= (+ 1 (* (select (select |#memory_int| rec_~op.base) 0) 2)) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:05,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#(and (= rec_~op.offset 0) (<= (+ 1 (* (select (select |#memory_int| rec_~op.base) 0) 2)) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {672#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:05,154 INFO L272 TraceCheckUtils]: 2: Hoare triple {672#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {637#(and (or (and (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) 0)) 1)) (>= oldRank0 0)) unseeded) (= 0 |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:05,154 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:36:05,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:05,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:05,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,165 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:36:05,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:05,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 122 transitions. Complement of second has 18 states. [2022-02-21 03:36:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:05,440 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:05,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:05,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 122 transitions. [2022-02-21 03:36:05,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:36:05,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,449 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:05,454 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:36:05,454 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:05,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,455 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:05,455 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:36:05,457 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:36:05,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 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:36:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:36:05,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:36:05,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:36:05,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:36:05,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:36:05,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:36:05,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:05,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 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:36:05,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:05,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:05,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:05,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:05,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:05,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:05,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:05,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:05,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 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:36:05,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:05,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:05,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:05,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:05,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:05,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:05,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:05,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:36:05,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:36:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:36:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:36:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:36:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:36:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:36:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:36:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:36:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,481 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-02-21 03:36:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:36:05,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:36:05,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2022-02-21 03:36:05,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-02-21 03:36:05,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 03:36:05,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2022-02-21 03:36:05,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:05,490 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-02-21 03:36:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2022-02-21 03:36:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-02-21 03:36:05,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:05,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:36:05,495 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:36:05,496 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:36:05,496 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:05,502 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2022-02-21 03:36:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2022-02-21 03:36:05,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:05,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:05,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:36:05,504 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:36:05,504 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:05,510 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-02-21 03:36:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-02-21 03:36:05,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:05,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:05,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:05,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:36:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-02-21 03:36:05,514 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:36:05,514 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:36:05,514 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:05,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2022-02-21 03:36:05,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:36:05,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,516 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:05,516 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:05,516 INFO L791 eck$LassoCheckResult]: Stem: 813#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 823#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 835#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 883#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 874#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 882#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 879#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 803#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 833#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 828#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 829#recFINAL assume true; 877#recEXIT >#42#return; 876#L19-1 #res := #t~ret5;havoc #t~ret5; 875#recFINAL assume true; 873#recEXIT >#44#return; 839#L36-1 assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; 824#L36-3 [2022-02-21 03:36:05,516 INFO L793 eck$LassoCheckResult]: Loop: 824#L36-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 825#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 854#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 852#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 848#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 851#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 855#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 849#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 851#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 855#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 856#recFINAL assume true; 858#recEXIT >#42#return; 850#L19-1 #res := #t~ret5;havoc #t~ret5; 853#recFINAL assume true; 847#recEXIT >#44#return; 844#L36-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 824#L36-3 [2022-02-21 03:36:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2022-02-21 03:36:05,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:05,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252429816] [2022-02-21 03:36:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:36:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:05,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:36:05,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1335#(= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) (* (- 1) |rec_#t~mem1|)) 0)} is VALID [2022-02-21 03:36:05,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#(= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) (* (- 1) |rec_#t~mem1|)) 0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:36:05,772 INFO L272 TraceCheckUtils]: 2: Hoare triple {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:05,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:05,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,776 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:36:05,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} #res := #t~ret5;havoc #t~ret5; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:05,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:05,777 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1321#true} #44#return; {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:36:05,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2022-02-21 03:36:05,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1321#true} is VALID [2022-02-21 03:36:05,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:05,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:05,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:05,779 INFO L272 TraceCheckUtils]: 5: Hoare triple {1321#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:05,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1335#(= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) (* (- 1) |rec_#t~mem1|)) 0)} is VALID [2022-02-21 03:36:05,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1335#(= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) (* (- 1) |rec_#t~mem1|)) 0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:36:05,781 INFO L272 TraceCheckUtils]: 8: Hoare triple {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:05,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {1334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:05,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:36:05,784 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1344#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:36:05,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} #res := #t~ret5;havoc #t~ret5; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:05,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:05,786 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1321#true} #44#return; {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:36:05,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1322#false} is VALID [2022-02-21 03:36:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:36:05,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:05,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252429816] [2022-02-21 03:36:05,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252429816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:05,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783729253] [2022-02-21 03:36:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:05,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:05,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,804 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-02-21 03:36:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-21 03:36:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:06,071 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:06,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-02-21 03:36:06,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-02-21 03:36:06,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2022-02-21 03:36:06,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1321#true} is VALID [2022-02-21 03:36:06,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:06,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:06,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:06,597 INFO L272 TraceCheckUtils]: 5: Hoare triple {1321#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1321#true} is VALID [2022-02-21 03:36:06,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1321#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1366#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2022-02-21 03:36:06,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1370#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:06,600 INFO L272 TraceCheckUtils]: 8: Hoare triple {1370#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1374#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:06,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {1374#(= |#memory_int| |old(#memory_int)|)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1378#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:36:06,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1378#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1382#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:36:06,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1382#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} assume true; {1382#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:36:06,603 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1382#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} {1370#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} #42#return; {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:36:06,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} #res := #t~ret5;havoc #t~ret5; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:06,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:06,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1321#true} #44#return; {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:36:06,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1322#false} is VALID [2022-02-21 03:36:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:06,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:07,678 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:36:08,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1322#false} is VALID [2022-02-21 03:36:08,429 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1321#true} #44#return; {1333#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:36:08,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:08,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} #res := #t~ret5;havoc #t~ret5; {1342#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:36:08,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1419#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1341#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:36:08,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1419#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} assume true; {1419#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:36:08,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1426#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1419#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:36:08,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1426#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} is VALID [2022-02-21 03:36:08,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1430#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} is VALID [2022-02-21 03:36:08,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1336#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:36:08,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {1321#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1434#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} is VALID [2022-02-21 03:36:08,435 INFO L272 TraceCheckUtils]: 5: Hoare triple {1321#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2022-02-21 03:36:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:08,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783729253] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:08,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:08,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-21 03:36:08,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378207818] [2022-02-21 03:36:08,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:08,437 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2022-02-21 03:36:08,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:08,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710031254] [2022-02-21 03:36:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:08,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:08,470 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:09,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:36:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:36:09,994 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:10,640 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2022-02-21 03:36:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:36:10,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:10,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:10,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 130 transitions. [2022-02-21 03:36:10,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:10,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 60 states and 77 transitions. [2022-02-21 03:36:10,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:36:10,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:36:10,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 77 transitions. [2022-02-21 03:36:10,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:10,709 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2022-02-21 03:36:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 77 transitions. [2022-02-21 03:36:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2022-02-21 03:36:10,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:10,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:10,712 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:10,712 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:10,712 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:10,715 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:10,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:10,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:10,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:10,717 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:10,718 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:10,721 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:10,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:10,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:10,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:10,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-02-21 03:36:10,724 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:10,724 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:10,724 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:10,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:36:10,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:10,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:10,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:10,725 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:10,725 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:10,725 INFO L791 eck$LassoCheckResult]: Stem: 1569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 1575#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1586#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1577#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1578#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1579#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1587#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 1567#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1597#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1583#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 1584#recFINAL assume true; 1596#recEXIT >#42#return; 1595#L19-1 #res := #t~ret5;havoc #t~ret5; 1594#recFINAL assume true; 1592#recEXIT >#44#return; 1590#L36-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 1580#L36-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 1581#L28-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1585#L28-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1576#L32 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1573#L36 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1572#recENTRY [2022-02-21 03:36:10,725 INFO L793 eck$LassoCheckResult]: Loop: 1572#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1582#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 1571#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1572#recENTRY [2022-02-21 03:36:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2022-02-21 03:36:10,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:10,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224404100] [2022-02-21 03:36:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,760 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2022-02-21 03:36:10,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:10,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061007914] [2022-02-21 03:36:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2022-02-21 03:36:10,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:10,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888969408] [2022-02-21 03:36:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:10,858 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,022 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:20,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:20,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:20,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:20,023 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:20,023 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:20,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:20,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration5_Lasso [2022-02-21 03:36:20,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:20,023 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:20,030 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:36:20,038 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:36:20,040 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:36:20,041 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:36:20,044 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:36:20,046 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:36:20,050 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:36:20,051 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:36:20,436 WARN L259 bleTransFormulaUtils]: 8 quantified variables [2022-02-21 03:36:20,437 WARN L259 bleTransFormulaUtils]: 8 quantified variables [2022-02-21 03:36:20,444 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:36:20,446 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:36:20,447 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:36:20,449 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:36:20,451 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:36:20,453 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:36:20,457 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:36:20,459 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:36:20,464 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:36:20,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:36:20,467 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:36:20,469 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:36:20,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:36:20,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:36:20,473 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:36:20,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,476 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:36:20,477 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:36:20,479 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:36:20,480 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:36:20,482 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:36:20,483 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:36:20,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:36:20,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:36:20,487 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:36:20,489 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:36:21,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:21,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:21,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,449 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:36:21,456 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:36:21,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,494 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:36:21,497 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:36:21,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:36:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,531 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:36:21,533 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:36:21,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:36:21,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,586 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:36:21,588 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:36:21,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,612 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:36:21,615 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:36:21,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:36:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,642 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:36:21,644 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:36:21,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:36:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,687 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:36:21,690 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:36:21,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,728 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:36:21,732 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:36:21,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,767 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:36:21,771 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:36:21,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:36:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,802 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:36:21,804 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:36:21,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,810 INFO L203 nArgumentSynthesizer]: 16 stem disjuncts [2022-02-21 03:36:21,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:21,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,839 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2022-02-21 03:36:21,839 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:36:21,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,911 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:36:21,913 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:36:21,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,946 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:36:21,948 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:36:21,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:36:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,975 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:21,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:36:21,977 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:36:21,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:22,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:22,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,011 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:36:22,013 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:36:22,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:22,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:22,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:22,046 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:36:22,046 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:36:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,051 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:36:22,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:22,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:22,074 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:22,074 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2022-02-21 03:36:22,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:36:22,100 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:36:22,104 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset);" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:36:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:22,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {2001#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2001#unseeded} is VALID [2022-02-21 03:36:22,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2001#unseeded} is VALID [2022-02-21 03:36:22,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,439 INFO L272 TraceCheckUtils]: 5: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,452 INFO L272 TraceCheckUtils]: 8: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,456 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:22,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2044#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2001#unseeded} #44#return; {2001#unseeded} is VALID [2022-02-21 03:36:22,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {2001#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2001#unseeded} is VALID [2022-02-21 03:36:22,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {2001#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2001#unseeded} is VALID [2022-02-21 03:36:22,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:22,460 INFO L272 TraceCheckUtils]: 21: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2001#unseeded} is VALID [2022-02-21 03:36:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:22,700 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:22,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:22,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {2004#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2093#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:22,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2097#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:22,815 INFO L272 TraceCheckUtils]: 2: Hoare triple {2097#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2024#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:22,815 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:36:22,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:22,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:22,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,836 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:36:22,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:22,984 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:22,984 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:22,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:22,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:22,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:22,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:22,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:22,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,986 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:22,986 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:22,986 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:22,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:22,987 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:22,987 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:22,987 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:22,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:22,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:22,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:22,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,998 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:22,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:22,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,999 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {2001#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2001#unseeded} is VALID [2022-02-21 03:36:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2001#unseeded} is VALID [2022-02-21 03:36:23,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,356 INFO L272 TraceCheckUtils]: 5: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,358 INFO L272 TraceCheckUtils]: 8: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:23,367 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2195#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2001#unseeded} #44#return; {2001#unseeded} is VALID [2022-02-21 03:36:23,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {2001#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2001#unseeded} is VALID [2022-02-21 03:36:23,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {2001#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2001#unseeded} is VALID [2022-02-21 03:36:23,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:23,368 INFO L272 TraceCheckUtils]: 21: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2001#unseeded} is VALID [2022-02-21 03:36:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,540 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:23,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:23,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {2004#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2244#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:23,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {2244#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2248#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:23,665 INFO L272 TraceCheckUtils]: 2: Hoare triple {2248#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2024#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:23,665 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:36:23,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:23,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:23,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:23,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:23,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:23,891 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:23,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:23,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:23,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:23,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:23,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:23,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,895 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:23,896 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:23,896 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:23,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:23,896 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:23,896 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:23,897 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:23,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:23,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:23,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:23,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:23,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:23,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:23,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,907 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:23,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:23,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,908 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:24,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {2001#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2001#unseeded} is VALID [2022-02-21 03:36:24,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2001#unseeded} is VALID [2022-02-21 03:36:24,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,309 INFO L272 TraceCheckUtils]: 5: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,312 INFO L272 TraceCheckUtils]: 8: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,328 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:24,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2346#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2001#unseeded} #44#return; {2001#unseeded} is VALID [2022-02-21 03:36:24,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {2001#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2001#unseeded} is VALID [2022-02-21 03:36:24,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {2001#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2001#unseeded} is VALID [2022-02-21 03:36:24,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {2001#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {2001#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2001#unseeded} is VALID [2022-02-21 03:36:24,332 INFO L272 TraceCheckUtils]: 21: Hoare triple {2001#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2001#unseeded} is VALID [2022-02-21 03:36:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:24,556 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:24,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:24,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {2004#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2395#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:24,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2395#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {2399#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:24,688 INFO L272 TraceCheckUtils]: 2: Hoare triple {2399#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2024#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:24,688 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:36:24,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:24,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,713 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:24,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:24,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 68 states and 78 transitions. Complement of second has 15 states. [2022-02-21 03:36:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:24,963 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:24,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:24,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:24,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:24,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2022-02-21 03:36:24,965 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:24,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:24,965 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:24,965 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:24,965 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:24,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:24,966 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:24,966 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:24,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:24,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:24,966 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:24,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:24,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:24,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:24,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:24,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:24,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:24,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:24,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:24,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,995 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-21 03:36:24,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:24,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:24,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 03:36:25,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:25,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:25,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:25,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2022-02-21 03:36:25,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:25,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:25,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:25,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:25,020 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:25,020 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:25,020 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:25,020 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:25,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:25,020 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:25,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:25,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:25 BoogieIcfgContainer [2022-02-21 03:36:25,025 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:25,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:25,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:25,026 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:25,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:40" (3/4) ... [2022-02-21 03:36:25,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:25,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:25,030 INFO L158 Benchmark]: Toolchain (without parser) took 44676.70ms. Allocated memory was 100.7MB in the beginning and 255.9MB in the end (delta: 155.2MB). Free memory was 66.0MB in the beginning and 139.5MB in the end (delta: -73.5MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,030 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 73.6MB in the beginning and 73.6MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:25,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.49ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 76.4MB in the end (delta: -10.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.86ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:25,031 INFO L158 Benchmark]: Boogie Preprocessor took 17.58ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 73.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,031 INFO L158 Benchmark]: RCFGBuilder took 331.99ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 60.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,031 INFO L158 Benchmark]: BuchiAutomizer took 44096.98ms. Allocated memory was 100.7MB in the beginning and 255.9MB in the end (delta: 155.2MB). Free memory was 59.6MB in the beginning and 139.5MB in the end (delta: -79.9MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:25,031 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 255.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:25,036 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.17ms. Allocated memory is still 100.7MB. Free memory was 73.6MB in the beginning and 73.6MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.49ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 76.4MB in the end (delta: -10.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.86ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.58ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 73.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.99ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 60.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 44096.98ms. Allocated memory was 100.7MB in the beginning and 255.9MB in the end (delta: 155.2MB). Free memory was 59.6MB in the beginning and 139.5MB in the end (delta: -79.9MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 255.9MB. Free memory is still 139.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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 38.4s. Construction of modules took 0.5s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 80 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital368 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp28 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf409 smp77 tf100 neg84 sie160 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 90ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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:36:25,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:25,356 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