./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51fd8b59df3c6c695de20ee68ac01a4d95dfb387fc1bc7a39558a7f011b3fbfd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:30:35,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:30:35,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:30:35,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:30:35,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:30:35,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:30:35,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:30:35,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:30:35,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:30:35,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:30:35,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:30:35,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:30:35,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:30:35,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:30:35,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:30:35,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:30:35,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:30:35,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:30:35,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:30:35,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:30:35,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:30:35,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:30:35,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:30:35,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:30:35,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:30:35,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:30:35,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:30:35,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:30:35,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:30:35,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:30:35,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:30:35,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:30:35,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:30:35,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:30:35,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:30:35,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:30:35,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:30:35,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:30:35,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:30:35,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:30:35,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:30:35,854 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:30:35,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:30:35,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:30:35,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:30:35,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:30:35,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:30:35,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:30:35,892 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:30:35,892 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:30:35,892 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:30:35,892 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:30:35,893 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:30:35,893 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:30:35,893 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:30:35,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:30:35,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:30:35,895 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:30:35,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:30:35,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:30:35,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:30:35,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:30:35,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:30:35,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:30:35,896 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:30:35,897 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 -> 51fd8b59df3c6c695de20ee68ac01a4d95dfb387fc1bc7a39558a7f011b3fbfd [2022-02-21 03:30:36,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:30:36,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:30:36,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:30:36,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:30:36,144 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:30:36,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i [2022-02-21 03:30:36,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a8872b/0dfcc938dcf64233b435a15dbd52f767/FLAG011365c10 [2022-02-21 03:30:36,582 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:30:36,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i [2022-02-21 03:30:36,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a8872b/0dfcc938dcf64233b435a15dbd52f767/FLAG011365c10 [2022-02-21 03:30:36,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a8872b/0dfcc938dcf64233b435a15dbd52f767 [2022-02-21 03:30:36,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:30:36,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:30:36,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:36,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:30:36,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:30:36,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:36,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4cd5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36, skipping insertion in model container [2022-02-21 03:30:36,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:36,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:30:36,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:30:36,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:36,906 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:30:36,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:36,972 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:30:36,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36 WrapperNode [2022-02-21 03:30:36,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:36,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:36,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:30:36,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:30:36,978 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:30:36" (1/1) ... [2022-02-21 03:30:36,997 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:30:36" (1/1) ... [2022-02-21 03:30:37,027 INFO L137 Inliner]: procedures = 110, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-21 03:30:37,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:37,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:30:37,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:30:37,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:30:37,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:30:37,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:30:37,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:30:37,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:30:37,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (1/1) ... [2022-02-21 03:30:37,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:37,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:37,108 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:30:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:30:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:30:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:30:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:30:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:30:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:30:37,135 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:30:37,233 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:30:37,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:30:37,404 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:30:37,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:30:37,409 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:30:37,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:37 BoogieIcfgContainer [2022-02-21 03:30:37,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:30:37,411 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:30:37,411 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:30:37,413 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:30:37,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:37,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:30:36" (1/3) ... [2022-02-21 03:30:37,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d983a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:37, skipping insertion in model container [2022-02-21 03:30:37,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:37,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:36" (2/3) ... [2022-02-21 03:30:37,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d983a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:37, skipping insertion in model container [2022-02-21 03:30:37,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:37,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:37" (3/3) ... [2022-02-21 03:30:37,416 INFO L388 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca.i [2022-02-21 03:30:37,449 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:30:37,450 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:30:37,450 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:30:37,450 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:30:37,450 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:30:37,450 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:30:37,450 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:30:37,450 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:30:37,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:37,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:37,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:37,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:37,482 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:30:37,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:37,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:37,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,484 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:37,484 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:37,488 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7#L551-2true [2022-02-21 03:30:37,488 INFO L793 eck$LassoCheckResult]: Loop: 7#L551-2true call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 11#L550-1true assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 9#L550-3true assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 8#L551true assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; 7#L551-2true [2022-02-21 03:30:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:30:37,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:37,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251718500] [2022-02-21 03:30:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,626 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2022-02-21 03:30:37,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:37,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572192445] [2022-02-21 03:30:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,690 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2022-02-21 03:30:37,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:37,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220013575] [2022-02-21 03:30:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:37,765 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:38,112 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:38,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:38,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:38,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:38,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:38,114 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,114 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:38,114 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:38,114 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration1_Lasso [2022-02-21 03:30:38,114 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:38,114 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:38,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:38,131 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:30:38,133 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:30:38,136 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:30:38,139 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:30:38,141 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:30:38,358 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:30:38,361 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:30:38,364 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:30:38,366 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:30:38,381 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:30:38,384 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:30:38,386 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:30:38,389 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:30:38,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:38,748 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:38,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:38,751 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:30:38,761 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:30:38,761 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:30:38,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:38,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:38,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:38,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:38,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:38,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:38,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:38,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:38,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:38,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:38,851 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:30:38,852 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:30:38,854 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:30:38,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:38,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:38,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:38,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:38,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:38,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:38,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:38,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:38,893 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:30:38,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:38,897 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:30:38,898 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:30:38,900 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:30:38,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:38,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:38,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:38,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:38,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:38,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:38,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:38,942 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:30:38,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:38,944 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:30:38,945 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:30:38,946 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:30:38,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:38,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:38,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:38,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:38,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:38,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:38,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:38,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:30:38,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:38,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:38,975 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:30:38,975 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:30:38,978 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:30:38,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:38,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:38,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:38,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:38,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:38,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:38,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:39,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:39,015 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:30:39,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:39,017 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:30:39,032 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:30:39,035 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:30:39,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:39,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:39,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:39,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:39,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:39,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:39,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:39,090 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:30:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:39,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:39,098 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:30:39,099 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:30:39,100 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:30:39,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:39,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:39,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:39,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:39,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:39,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:39,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:39,178 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:30:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:39,180 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:30:39,180 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:30:39,182 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:30:39,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:39,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:39,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:39,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:39,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:39,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:39,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:39,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:39,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:39,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:39,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:39,214 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:30:39,215 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:30:39,217 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:30:39,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:39,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:39,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:39,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:39,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:39,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:39,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:39,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:39,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:30:39,236 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:30:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:39,239 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:30:39,252 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:30:39,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:39,257 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:30:39,258 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:39,258 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:30:39,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:39,317 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:39,321 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0;" "assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0;" "assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1;" "assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1;" [2022-02-21 03:30:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:39,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {20#unseeded} is VALID [2022-02-21 03:30:39,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {20#unseeded} is VALID [2022-02-21 03:30:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:39,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {96#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:39,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {100#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:39,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {100#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:39,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; {88#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:39,529 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:30:39,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:39,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:39,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 48 transitions. Complement of second has 10 states. [2022-02-21 03:30:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:39,654 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:39,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:39,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:39,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:30:39,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:39,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:39,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2022-02-21 03:30:39,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:39,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:39,667 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,669 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:39,669 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:30:39,676 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:30:39,676 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 48 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:39,677 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:39,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:30:39,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:30:39,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:30:39,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:39,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:39,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:39,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:39,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:39,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:39,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:39,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:39,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:39,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:39,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:39,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:39,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:39,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:39,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:39,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:39,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:39,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:39,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:39,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:39,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:39,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:39,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 48 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,700 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-21 03:30:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2022-02-21 03:30:39,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:39,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:39,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2022-02-21 03:30:39,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:30:39,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:30:39,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2022-02-21 03:30:39,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:39,716 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:30:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2022-02-21 03:30:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-02-21 03:30:39,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:39,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,732 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,733 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,735 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:39,737 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 03:30:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:30:39,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:39,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:39,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 03:30:39,738 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 03:30:39,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:39,740 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 03:30:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:30:39,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:39,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:39,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:39,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2022-02-21 03:30:39,743 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:30:39,743 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:30:39,744 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:30:39,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:30:39,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:39,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:39,747 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:39,747 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:39,747 INFO L791 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 173#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 167#L550-1 assume !main_#t~short6#1; 174#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 168#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 163#L551-2 [2022-02-21 03:30:39,747 INFO L793 eck$LassoCheckResult]: Loop: 163#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 164#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 170#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 171#L551 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; 163#L551-2 [2022-02-21 03:30:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2022-02-21 03:30:39,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:39,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582145958] [2022-02-21 03:30:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:39,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {243#true} is VALID [2022-02-21 03:30:39,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {243#true} is VALID [2022-02-21 03:30:39,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {243#true} is VALID [2022-02-21 03:30:39,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#true} assume !main_#t~short6#1; {245#(not |ULTIMATE.start_main_#t~short6#1|)} is VALID [2022-02-21 03:30:39,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {245#(not |ULTIMATE.start_main_#t~short6#1|)} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {244#false} is VALID [2022-02-21 03:30:39,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#false} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {244#false} is VALID [2022-02-21 03:30:39,794 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:30:39,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:39,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582145958] [2022-02-21 03:30:39,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582145958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:39,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:39,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:30:39,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490830521] [2022-02-21 03:30:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:39,797 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:30:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2022-02-21 03:30:39,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:39,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186959902] [2022-02-21 03:30:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,810 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:39,874 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:30:39,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:30:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:30:39,939 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:39,952 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:30:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:30:39,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:39,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-02-21 03:30:39,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2022-02-21 03:30:39,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:30:39,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:30:39,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2022-02-21 03:30:39,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:39,959 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:30:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2022-02-21 03:30:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:30:39,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:39,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,960 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,961 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,961 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:39,961 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:30:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:30:39,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:39,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:39,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 17 transitions. [2022-02-21 03:30:39,962 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 17 transitions. [2022-02-21 03:30:39,962 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:39,962 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:30:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:30:39,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:39,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:39,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:39,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 03:30:39,963 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:30:39,963 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:30:39,963 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:30:39,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:30:39,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:39,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:39,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:39,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:39,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:39,964 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 277#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 271#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 278#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 272#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 267#L551-2 [2022-02-21 03:30:39,964 INFO L793 eck$LassoCheckResult]: Loop: 267#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 268#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 274#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 275#L551 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; 267#L551-2 [2022-02-21 03:30:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2022-02-21 03:30:39,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:39,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214056388] [2022-02-21 03:30:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,988 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2022-02-21 03:30:39,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:39,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994685564] [2022-02-21 03:30:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:39,999 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2022-02-21 03:30:39,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:39,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844148409] [2022-02-21 03:30:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:40,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:40,027 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:40,445 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:40,445 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:40,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:40,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:40,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:40,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:40,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:40,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:40,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration3_Lasso [2022-02-21 03:30:40,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:40,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:40,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:30:40,450 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:30:40,452 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:30:40,660 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:40,663 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:40,666 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:30:40,668 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:30:40,670 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:30:40,672 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:30:40,674 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:30:40,676 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:30:40,678 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:30:40,679 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:30:40,681 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:30:40,683 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:30:40,685 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:30:40,687 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:30:40,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:40,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:40,991 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:30:41,002 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:30:41,006 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:30:41,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:41,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:41,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:41,012 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:30:41,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:41,015 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:30:41,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:41,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:41,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:30:41,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:41,034 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:30:41,035 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:30:41,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:41,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:41,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:41,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:41,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:41,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:41,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:41,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:41,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:41,132 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:30:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:41,134 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:30:41,135 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:30:41,136 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:30:41,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:41,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:41,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:41,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:41,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:41,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:41,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:41,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:41,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:41,212 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:30:41,224 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:30:41,225 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:30:41,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:41,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:41,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:41,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:41,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:41,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:41,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:41,249 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:30:41,249 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:30:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:41,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:41,251 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:30:41,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:41,265 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:30:41,286 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:41,286 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:41,286 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 Supporting invariants [] [2022-02-21 03:30:41,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:41,338 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:41,341 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0;" "assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0;" "assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1;" "assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1;" [2022-02-21 03:30:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:41,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:41,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:41,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {348#unseeded} is VALID [2022-02-21 03:30:41,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {348#unseeded} is VALID [2022-02-21 03:30:41,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {348#unseeded} is VALID [2022-02-21 03:30:41,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {348#unseeded} is VALID [2022-02-21 03:30:41,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {348#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {348#unseeded} is VALID [2022-02-21 03:30:41,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {348#unseeded} is VALID [2022-02-21 03:30:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:41,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:41,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:41,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {436#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:41,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {440#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:41,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {440#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {440#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:41,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {440#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; {416#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:41,502 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:30:41,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,509 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:30:41,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:41,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 27 transitions. Complement of second has 7 states. [2022-02-21 03:30:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:41,549 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:41,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:41,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:41,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:41,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:41,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:41,552 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:41,552 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:41,552 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:41,552 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:41,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:41,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:41,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:41,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,559 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:30:41,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:41,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:41,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:30:41,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:41,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:41,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:41,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:30:41,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:30:41,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:30:41,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:41,561 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:30:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-21 03:30:41,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:41,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,563 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,563 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,563 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:41,564 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-21 03:30:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:41,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:41,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 27 transitions. [2022-02-21 03:30:41,564 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 27 transitions. [2022-02-21 03:30:41,564 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:41,565 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-21 03:30:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:41,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:41,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:41,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:30:41,566 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:30:41,566 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:30:41,566 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:30:41,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:30:41,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:41,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2022-02-21 03:30:41,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:41,567 INFO L791 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 480#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 492#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 496#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 495#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 494#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 493#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 485#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 489#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 486#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 481#L551-2 [2022-02-21 03:30:41,567 INFO L793 eck$LassoCheckResult]: Loop: 481#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 482#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 500#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 499#L551 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; 481#L551-2 [2022-02-21 03:30:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2022-02-21 03:30:41,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660695260] [2022-02-21 03:30:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,609 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2022-02-21 03:30:41,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143231776] [2022-02-21 03:30:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,618 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2022-02-21 03:30:41,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243821429] [2022-02-21 03:30:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,663 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:41,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:42,249 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:42,249 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:42,249 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:42,249 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:42,249 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:42,249 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:42,249 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:42,249 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:42,249 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration4_Lasso [2022-02-21 03:30:42,249 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:42,249 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:42,252 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:30:42,256 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:30:42,266 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:30:42,268 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:30:42,270 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:30:42,272 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:30:42,275 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:30:42,277 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:30:42,499 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:30:42,500 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:30:42,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:30:42,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:30:42,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:30:42,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:30:42,511 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:30:42,513 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:30:42,515 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:30:42,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:42,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:42,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:42,851 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:30:42,852 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:30:42,853 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:30:42,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:42,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:42,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:42,860 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:30:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:42,861 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:30:42,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:42,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:42,902 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:30:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:42,904 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:30:42,905 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:30:42,968 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:30:42,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:42,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:42,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:42,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:42,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:42,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:42,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:42,998 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:30:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:42,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:42,999 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:30:43,000 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:30:43,001 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:30:43,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,029 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:30:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,030 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:30:43,035 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:30:43,037 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:30:43,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,094 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:30:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,096 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:30:43,097 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:30:43,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:43,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,132 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:30:43,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,134 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:30:43,135 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:30:43,136 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:30:43,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:30:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,165 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:30:43,166 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:30:43,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:43,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,195 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:30:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,197 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:30:43,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:30:43,200 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:30:43,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,230 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:30:43,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,233 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:30:43,234 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:30:43,235 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:30:43,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:30:43,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,278 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:30:43,279 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:30:43,280 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:30:43,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,308 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:30:43,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,310 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:30:43,311 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:30:43,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:43,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,357 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:30:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,358 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:30:43,361 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:30:43,361 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:30:43,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,393 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:30:43,395 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:30:43,396 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:30:43,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,422 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:30:43,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,423 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:30:43,424 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:30:43,425 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:30:43,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:30:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,455 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:30:43,458 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:30:43,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:43,492 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:30:43,492 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:30:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,503 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:30:43,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:43,524 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:30:43,532 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:43,532 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:43,532 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3 Supporting invariants [] [2022-02-21 03:30:43,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,608 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:43,611 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0;" "assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0;" "assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1;" "assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1;" [2022-02-21 03:30:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:43,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {596#unseeded} is VALID [2022-02-21 03:30:43,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {596#unseeded} is VALID [2022-02-21 03:30:43,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:43,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:43,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:43,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:43,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {696#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:43,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {700#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:43,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {700#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {700#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:43,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {700#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; {664#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:43,772 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:30:43,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:43,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:43,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:43,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 35 transitions. Complement of second has 7 states. [2022-02-21 03:30:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:43,846 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:43,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:43,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:43,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:43,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:43,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:43,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:43,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:43,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:30:43,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:43,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:43,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:43,848 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:43,848 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:43,848 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:43,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:43,849 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:43,849 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:43,849 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,854 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:30:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,862 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:30:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:43,863 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:43,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {596#unseeded} is VALID [2022-02-21 03:30:43,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {596#unseeded} is VALID [2022-02-21 03:30:43,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:43,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:43,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:43,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:43,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:43,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:44,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {776#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {780#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {780#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; {664#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:44,027 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:30:44,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:44,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,038 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:44,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 35 transitions. Complement of second has 7 states. [2022-02-21 03:30:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:44,065 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:44,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:44,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:30:44,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:44,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:44,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:44,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:44,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:44,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:44,069 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:44,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:30:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,079 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:30:44,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,080 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:44,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {596#unseeded} is VALID [2022-02-21 03:30:44,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {596#unseeded} is VALID [2022-02-21 03:30:44,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:44,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:44,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:44,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:44,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#unseeded} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:44,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#unseeded} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {596#unseeded} is VALID [2022-02-21 03:30:44,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#unseeded} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {596#unseeded} is VALID [2022-02-21 03:30:44,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#unseeded} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {596#unseeded} is VALID [2022-02-21 03:30:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:44,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {856#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {860#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {860#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem8#1; {664#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:44,226 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:30:44,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:44,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,234 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:44,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 40 transitions. Complement of second has 6 states. [2022-02-21 03:30:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:44,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:44,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:44,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. [2022-02-21 03:30:44,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:44,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:44,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:44,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:44,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:44,271 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 40 transitions. cyclomatic complexity: 11 [2022-02-21 03:30:44,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:30:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:30:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:30:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:30:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:30:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:30:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,280 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:30:44,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:44,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:30:44,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:30:44,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. cyclomatic complexity: 11 [2022-02-21 03:30:44,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:44,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2022-02-21 03:30:44,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:30:44,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:30:44,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2022-02-21 03:30:44,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:44,284 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-21 03:30:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2022-02-21 03:30:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2022-02-21 03:30:44,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:44,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 32 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,285 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 32 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,285 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,286 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,286 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-21 03:30:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-21 03:30:44,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 32 transitions. [2022-02-21 03:30:44,287 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 32 transitions. [2022-02-21 03:30:44,287 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,288 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-21 03:30:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-21 03:30:44,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:44,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 03:30:44,289 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:30:44,289 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:30:44,289 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:30:44,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:30:44,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:44,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,290 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:44,290 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:44,290 INFO L791 eck$LassoCheckResult]: Stem: 908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 910#L551-2 [2022-02-21 03:30:44,290 INFO L793 eck$LassoCheckResult]: Loop: 910#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 911#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 916#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 914#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 910#L551-2 [2022-02-21 03:30:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:30:44,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129455412] [2022-02-21 03:30:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,299 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2022-02-21 03:30:44,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389100725] [2022-02-21 03:30:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,316 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2022-02-21 03:30:44,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105854743] [2022-02-21 03:30:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,345 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:44,621 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:44,621 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:44,621 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:44,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:44,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:44,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:44,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:44,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:44,622 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration5_Lasso [2022-02-21 03:30:44,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:44,622 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:44,623 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:30:44,625 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:30:44,627 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:30:44,629 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:30:44,631 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:30:44,633 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:30:44,634 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:30:44,637 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:30:44,639 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:30:44,641 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:30:44,643 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:30:44,645 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:30:44,647 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:30:45,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:45,152 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,153 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:30:45,154 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:30:45,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:45,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:45,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,178 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:30:45,179 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:30:45,180 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:30:45,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,202 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:30:45,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,205 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:30:45,205 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:30:45,207 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:30:45,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,229 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:30:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,231 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:30:45,236 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:30:45,238 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:30:45,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:45,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,263 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:30:45,264 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:30:45,265 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:30:45,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,301 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:30:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,302 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:30:45,303 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:30:45,305 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:30:45,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,342 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:30:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,343 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:30:45,344 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:30:45,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:45,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:30:45,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,378 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:30:45,380 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:30:45,380 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:30:45,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,405 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:30:45,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,407 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:30:45,408 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:30:45,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:45,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:30:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,433 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:30:45,434 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:30:45,435 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:30:45,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:30:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,459 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:30:45,468 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:30:45,468 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:30:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,492 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:30:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,493 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:30:45,494 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:30:45,495 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:30:45,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:30:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,533 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:30:45,534 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:30:45,535 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:30:45,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,566 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:30:45,568 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:30:45,568 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:30:45,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,621 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:30:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,623 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:30:45,625 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:30:45,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:45,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,664 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,688 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:30:45,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:30:45,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:30:45,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,731 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:30:45,735 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:30:45,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:30:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,770 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:30:45,772 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:30:45,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:45,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:45,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:45,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:30:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,810 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:30:45,812 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:30:45,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:45,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:45,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:45,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:45,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:45,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:45,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:45,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:45,834 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:30:45,834 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:30:45,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:45,836 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:45,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:30:45,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:45,838 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:30:45,838 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:45,838 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_4 Supporting invariants [] [2022-02-21 03:30:45,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:30:45,884 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:45,894 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0;" "assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0;" "assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1;" "assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1;" [2022-02-21 03:30:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:45,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:30:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:45,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:45,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {1013#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1013#unseeded} is VALID [2022-02-21 03:30:45,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~nondet9#1, main_#t~mem10#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1083#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:45,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:45,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:46,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {1084#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; {1084#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:46,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; {1098#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:46,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {1098#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short6#1|)) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; {1102#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:30:46,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {1102#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(main_#t~nondet9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; {1086#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))))} is VALID [2022-02-21 03:30:46,106 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:30:46,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:46,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:46,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:46,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:46,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 8 states. [2022-02-21 03:30:46,180 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:30:46,180 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:46,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 3 [2022-02-21 03:30:46,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:46,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:46,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:46,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:46,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:46,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:46,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-02-21 03:30:46,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:46,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:46,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 3 [2022-02-21 03:30:46,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:46,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:46,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:46,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:46,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 33 transitions. cyclomatic complexity: 9 [2022-02-21 03:30:46,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. cyclomatic complexity: 9 [2022-02-21 03:30:46,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:46,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:46,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:30:46,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:30:46,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:30:46,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:46,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:46,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:30:46,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:46,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:46,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:46,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:46,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:46,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:30:46,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:46,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:30:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:46,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,193 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:30:46,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:46,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:46,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2022-02-21 03:30:46,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:46,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. cyclomatic complexity: 9 [2022-02-21 03:30:46,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:46,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:30:46,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:30:46,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:46,196 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:30:46,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:30:46,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:46,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:46,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:30:46 BoogieIcfgContainer [2022-02-21 03:30:46,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:30:46,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:30:46,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:30:46,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:30:46,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:37" (3/4) ... [2022-02-21 03:30:46,204 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:30:46,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:30:46,205 INFO L158 Benchmark]: Toolchain (without parser) took 9591.16ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 69.0MB in the beginning and 61.9MB in the end (delta: 7.1MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2022-02-21 03:30:46,205 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:46,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.65ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 72.9MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:30:46,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.41ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:46,206 INFO L158 Benchmark]: Boogie Preprocessor took 35.34ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 69.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:46,206 INFO L158 Benchmark]: RCFGBuilder took 345.26ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 58.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:30:46,206 INFO L158 Benchmark]: BuchiAutomizer took 8790.92ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 58.7MB in the beginning and 61.9MB in the end (delta: -3.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:46,206 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 148.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:46,207 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.18ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.65ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 72.9MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.41ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.34ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 69.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.26ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 58.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8790.92ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 58.7MB in the beginning and 61.9MB in the end (delta: -3.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 148.9MB. Free memory is still 61.9MB. 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 (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 50 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital244 mio100 ax109 hnf100 lsp86 ukn64 mio100 lsp39 div100 bol100 ite100 ukn100 eq181 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:30:46,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:46,443 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