./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.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 07cb858ca28d12a9573701578f47459476309a96d5b39f0788685d157bc55381 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:44,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:44,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:44,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:44,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:44,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:44,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:44,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:44,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:44,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:44,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:44,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:44,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:44,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:44,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:44,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:44,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:44,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:44,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:44,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:44,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:44,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:44,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:44,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:44,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:44,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:44,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:44,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:44,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:44,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:44,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:44,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:44,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:44,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:44,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:44,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:44,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:44,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:44,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:44,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:44,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:44,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:45,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:45,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:45,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:45,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:45,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:45,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:45,015 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:45,015 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:45,015 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:45,015 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:45,016 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:45,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:45,016 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:45,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:45,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:45,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:45,018 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:45,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:45,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:45,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:45,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:45,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:45,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:45,021 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:45,021 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 -> 07cb858ca28d12a9573701578f47459476309a96d5b39f0788685d157bc55381 [2022-02-21 03:35:45,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:45,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:45,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:45,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:45,253 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:45,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2022-02-21 03:35:45,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7755f282d/a6bc3493b5d0481987792d2f5a18fe14/FLAGba95273b7 [2022-02-21 03:35:45,699 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:45,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2022-02-21 03:35:45,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7755f282d/a6bc3493b5d0481987792d2f5a18fe14/FLAGba95273b7 [2022-02-21 03:35:45,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7755f282d/a6bc3493b5d0481987792d2f5a18fe14 [2022-02-21 03:35:45,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:45,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:45,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:45,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:45,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:45,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d065d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45, skipping insertion in model container [2022-02-21 03:35:45,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:45,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:45,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:45,900 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:45,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:45,944 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:45,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45 WrapperNode [2022-02-21 03:35:45,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:45,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:45,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:45,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:45,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,975 INFO L137 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-21 03:35:45,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:45,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:45,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:45,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:45,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:45,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:46,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:46,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:46,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:46,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:46,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:46,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (1/1) ... [2022-02-21 03:35:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:46,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:46,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:46,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:46,128 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:46,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:46,406 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:46,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:46,410 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:46,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:46 BoogieIcfgContainer [2022-02-21 03:35:46,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:46,412 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:46,412 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:46,415 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:46,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:45" (1/3) ... [2022-02-21 03:35:46,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39623c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:46, skipping insertion in model container [2022-02-21 03:35:46,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:45" (2/3) ... [2022-02-21 03:35:46,418 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39623c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:46, skipping insertion in model container [2022-02-21 03:35:46,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:46" (3/3) ... [2022-02-21 03:35:46,419 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D.i [2022-02-21 03:35:46,466 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:46,466 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:46,466 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:46,466 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:46,466 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:46,467 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:46,467 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:46,467 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:46,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:46,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:46,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:46,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,518 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:46,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:46,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:46,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,526 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:46,526 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,530 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 18#L30-3true [2022-02-21 03:35:46,532 INFO L793 eck$LassoCheckResult]: Loop: 18#L30-3true call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 10#L30-1true assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 11#L34true assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 14#L38true call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 13#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 12#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 16#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 6#L38-3true call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 18#L30-3true [2022-02-21 03:35:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:46,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804163624] [2022-02-21 03:35:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,645 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,677 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2022-02-21 03:35:46,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4032892] [2022-02-21 03:35:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:35:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:46,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:46,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:46,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:46,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:46,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {24#true} is VALID [2022-02-21 03:35:46,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-21 03:35:46,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} is VALID [2022-02-21 03:35:46,924 INFO L272 TraceCheckUtils]: 3: Hoare triple {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:46,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:46,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:46,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:46,927 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:46,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {25#false} is VALID [2022-02-21 03:35:46,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {25#false} is VALID [2022-02-21 03:35:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:46,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:46,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4032892] [2022-02-21 03:35:46,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4032892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:46,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:46,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:46,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59411314] [2022-02-21 03:35:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:46,934 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:46,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:46,958 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,203 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:35:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:35:47,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:47,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:47,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-02-21 03:35:47,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:47,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2022-02-21 03:35:47,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:35:47,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:47,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 03:35:47,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:47,232 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 03:35:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:35:47,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:47,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,253 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,254 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,257 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:47,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:47,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:47,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:47,258 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,260 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:47,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:47,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:47,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:47,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:35:47,262 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:47,262 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:47,262 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:47,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:47,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:47,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:47,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:47,264 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:47,264 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:47,264 INFO L791 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 63#L30-3 [2022-02-21 03:35:47,264 INFO L793 eck$LassoCheckResult]: Loop: 63#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 67#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 68#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 65#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 69#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 64#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 69#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 70#recFINAL assume true; 71#recEXIT >#42#return; 72#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 73#recFINAL assume true; 74#recEXIT >#44#return; 61#L38-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 62#L38-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 63#L30-3 [2022-02-21 03:35:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:35:47,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345590474] [2022-02-21 03:35:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,280 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2022-02-21 03:35:47,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411028989] [2022-02-21 03:35:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,352 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2022-02-21 03:35:47,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072188022] [2022-02-21 03:35:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,429 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:49,761 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:49,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:49,762 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:49,762 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:49,762 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:49,762 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,762 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:49,762 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:49,762 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration2_Lasso [2022-02-21 03:35:49,762 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:49,762 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:49,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,965 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:49,966 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:49,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:49,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:50,319 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:50,322 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:50,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:35:50,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:50,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:50,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:50,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:50,366 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:35:50,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:35:50,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:50,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:50,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:50,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:50,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:50,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:50,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:50,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:50,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:35:50,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:50,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:50,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:50,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:50,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:50,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:50,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:50,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:50,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:50,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:50,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:50,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:50,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:50,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:50,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:50,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:50,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:50,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:50,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:50,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:50,554 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:35:50,554 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:35:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:50,557 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:35:50,558 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:35:50,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:50,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:50,604 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:50,604 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:35:50,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:50,631 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:35:50,636 INFO L390 LassoCheck]: Loop: "call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0;" "assume true;" >"#42#return;" "~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0;" "assume true;" >"#44#return;" "assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1;" "call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1;" [2022-02-21 03:35:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:50,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {116#unseeded} is VALID [2022-02-21 03:35:50,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {116#unseeded} is VALID [2022-02-21 03:35:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:35:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:50,824 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 03:35:50,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-02-21 03:35:50,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:35:50,908 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:35:50,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:35:50,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:35:50,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:35:51,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {142#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:35:51,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {146#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} is VALID [2022-02-21 03:35:51,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {150#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:51,121 INFO L272 TraceCheckUtils]: 3: Hoare triple {150#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} assume true; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {154#(<= |old(oldRank0)| oldRank0)} {154#(<= |old(oldRank0)| oldRank0)} #42#return; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#(<= |old(oldRank0)| oldRank0)} assume true; {154#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:51,128 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {154#(<= |old(oldRank0)| oldRank0)} {150#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} #44#return; {185#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:51,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {189#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} is VALID [2022-02-21 03:35:51,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {189#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {134#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))))} is VALID [2022-02-21 03:35:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:35:51,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:51,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-02-21 03:35:51,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:51,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 62 states and 73 transitions. Complement of second has 17 states. [2022-02-21 03:35:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:51,440 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:51,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:51,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:51,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:51,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:51,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:51,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:51,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:51,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2022-02-21 03:35:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:51,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:51,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:51,456 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:51,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:51,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:51,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:51,468 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:51,468 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:51,478 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:51,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:51,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:51,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:51,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:51,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:51,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:51,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:51,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:51,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:51,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:51,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:51,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:51,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:51,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:51,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:51,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:51,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:51,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:51,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:51,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:51,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:51,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:51,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:51,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:51,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:51,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:51,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:51,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:51,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:51,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:51,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:51,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:51,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:51,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:51,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:51,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:51,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:51,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:51,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:51,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:51,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:51,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:51,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:51,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:51,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:51,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:51,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:51,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:51,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:51,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:51,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:51,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:51,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:51,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:51,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:51,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:51,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:51,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:51,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:51,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:51,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:51,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,526 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:35:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:51,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:51,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2022-02-21 03:35:51,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:51,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:51,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:51,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2022-02-21 03:35:51,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 03:35:51,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-02-21 03:35:51,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2022-02-21 03:35:51,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:51,550 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-02-21 03:35:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2022-02-21 03:35:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-02-21 03:35:51,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:51,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:51,558 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:51,558 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:51,558 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:51,569 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:51,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:51,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:51,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:51,572 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:51,572 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:51,579 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:51,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:51,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:51,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:51,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-21 03:35:51,588 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:51,588 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:51,588 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:51,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2022-02-21 03:35:51,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:51,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:51,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:51,593 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:51,593 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:51,594 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 286#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 295#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 296#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 297#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 300#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 306#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 331#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 290#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 291#recENTRY [2022-02-21 03:35:51,594 INFO L793 eck$LassoCheckResult]: Loop: 291#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 302#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 289#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 291#recENTRY [2022-02-21 03:35:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2022-02-21 03:35:51,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:51,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109111736] [2022-02-21 03:35:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,684 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2022-02-21 03:35:51,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:51,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499537730] [2022-02-21 03:35:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,707 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2022-02-21 03:35:51,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:51,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916441669] [2022-02-21 03:35:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,760 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:55,238 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:55,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:55,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:55,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:55,239 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:55,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:55,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:55,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration3_Lasso [2022-02-21 03:35:55,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:55,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:55,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,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:35:55,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,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:35:55,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:35:55,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,503 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:55,504 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:55,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,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:35:55,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:35:55,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:35:55,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:56,002 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:56,002 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:56,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,005 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:35:56,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,031 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:35:56,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,055 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:35:56,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,057 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:35:56,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,070 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:35:56,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,094 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:35:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,096 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:35:56,097 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:35:56,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:35:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,136 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:35:56,149 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:35:56,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,189 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:35:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,190 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:35:56,191 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:35:56,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,214 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:35:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,215 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:35:56,217 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:35:56,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:35:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,241 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:35:56,242 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:35:56,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,280 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:35:56,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,282 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:35:56,282 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:35:56,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,306 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:35:56,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,307 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:35:56,307 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:35:56,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,333 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:35:56,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,335 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:35:56,335 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:35:56,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,359 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:35:56,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,360 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:35:56,361 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:35:56,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,383 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:35:56,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,385 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:35:56,394 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:35:56,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,434 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:35:56,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,436 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:35:56,439 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:35:56,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,468 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:35:56,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,469 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:35:56,470 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:35:56,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:56,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,518 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:35:56,521 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:35:56,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:35:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,553 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:35:56,554 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:35:56,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:35:56,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,581 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:35:56,582 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:35:56,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,604 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:35:56,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,606 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:35:56,606 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:35:56,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:35:56,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,634 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:35:56,634 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:35:56,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,666 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:35:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,668 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:35:56,668 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:35:56,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:35:56,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,693 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:35:56,694 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:35:56,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:35:56,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,732 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:35:56,732 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:35:56,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,765 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:35:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,766 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:35:56,767 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:35:56,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,791 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:35:56,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,794 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:35:56,794 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:35:56,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,800 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-02-21 03:35:56,800 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:56,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,817 INFO L401 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2022-02-21 03:35:56,818 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:35:56,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:35:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,853 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:35:56,853 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:35:56,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:35:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,881 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:35:56,881 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:35:56,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,894 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:56,901 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:56,902 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:35:56,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,903 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:35:56,904 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:35:56,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:56,910 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:56,910 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:56,911 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:35:56,947 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:35:56,955 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:35:56,958 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:35:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:57,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {614#unseeded} is VALID [2022-02-21 03:35:57,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {614#unseeded} is VALID [2022-02-21 03:35:57,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {614#unseeded} is VALID [2022-02-21 03:35:57,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {614#unseeded} is VALID [2022-02-21 03:35:57,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {614#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {614#unseeded} is VALID [2022-02-21 03:35:57,074 INFO L272 TraceCheckUtils]: 5: Hoare triple {614#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {614#unseeded} is VALID [2022-02-21 03:35:57,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#unseeded} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {614#unseeded} is VALID [2022-02-21 03:35:57,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {614#unseeded} is VALID [2022-02-21 03:35:57,076 INFO L272 TraceCheckUtils]: 8: Hoare triple {614#unseeded} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {614#unseeded} is VALID [2022-02-21 03:35:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:35:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:57,246 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:57,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:35:57,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {661#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:35:57,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {665#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:35:57,325 INFO L272 TraceCheckUtils]: 2: Hoare triple {665#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {632#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:35:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:57,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:57,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:57,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,347 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:35:57,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:57,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 122 transitions. Complement of second has 17 states. [2022-02-21 03:35:57,472 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:35:57,472 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:57,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:35:57,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:57,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:57,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 122 transitions. [2022-02-21 03:35:57,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,476 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:35:57,479 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:57,479 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:57,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:57,481 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:57,481 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:35:57,485 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,514 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:35:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:35:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:35:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:35:57,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2022-02-21 03:35:57,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-02-21 03:35:57,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 03:35:57,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2022-02-21 03:35:57,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:57,526 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-02-21 03:35:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2022-02-21 03:35:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-02-21 03:35:57,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:57,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,538 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,539 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,539 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:57,542 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:35:57,557 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2022-02-21 03:35:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2022-02-21 03:35:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:57,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:57,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:35:57,561 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:35:57,561 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:57,574 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-02-21 03:35:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-02-21 03:35:57,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:57,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:57,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:57,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-02-21 03:35:57,577 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:35:57,577 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:35:57,578 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:57,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2022-02-21 03:35:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,579 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:57,579 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:57,579 INFO L791 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 805#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 833#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 873#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 811#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 872#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 810#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 803#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 849#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 869#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 824#recFINAL assume true; 825#recEXIT >#42#return; 846#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 844#recFINAL assume true; 843#recEXIT >#44#return; 791#L38-1 assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; 792#L38-3 [2022-02-21 03:35:57,580 INFO L793 eck$LassoCheckResult]: Loop: 792#L38-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 797#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 854#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 851#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 840#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 842#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 847#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 839#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 842#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 847#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 848#recFINAL assume true; 853#recEXIT >#42#return; 841#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 845#recFINAL assume true; 838#recEXIT >#44#return; 837#L38-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 792#L38-3 [2022-02-21 03:35:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2022-02-21 03:35:57,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:57,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805974500] [2022-02-21 03:35:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:35:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1325#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} is VALID [2022-02-21 03:35:57,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:57,729 INFO L272 TraceCheckUtils]: 2: Hoare triple {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,731 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,733 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1311#true} #44#return; {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:57,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1311#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1311#true} is VALID [2022-02-21 03:35:57,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1311#true} is VALID [2022-02-21 03:35:57,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1311#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:57,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1311#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:57,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {1311#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:57,735 INFO L272 TraceCheckUtils]: 5: Hoare triple {1311#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1325#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} is VALID [2022-02-21 03:35:57,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:57,737 INFO L272 TraceCheckUtils]: 8: Hoare triple {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1333#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,739 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1334#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1311#true} #44#return; {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:57,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1312#false} is VALID [2022-02-21 03:35:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:57,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:57,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805974500] [2022-02-21 03:35:57,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805974500] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:57,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759953178] [2022-02-21 03:35:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:57,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:57,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,743 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-21 03:35:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-21 03:35:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:57,942 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:57,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-02-21 03:35:58,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-02-21 03:35:58,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {1311#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1311#true} is VALID [2022-02-21 03:35:58,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1311#true} is VALID [2022-02-21 03:35:58,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1311#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:58,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {1311#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:58,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {1311#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:58,291 INFO L272 TraceCheckUtils]: 5: Hoare triple {1311#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1311#true} is VALID [2022-02-21 03:35:58,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1356#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2022-02-21 03:35:58,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1360#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:35:58,294 INFO L272 TraceCheckUtils]: 8: Hoare triple {1360#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1364#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:58,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1364#(= |#memory_int| |old(#memory_int)|)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1368#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:58,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {1368#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {1372#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:35:58,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1372#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} assume true; {1372#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:35:58,297 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1372#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} {1360#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} #42#return; {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:58,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:58,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:58,299 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1311#true} #44#return; {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:58,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1312#false} is VALID [2022-02-21 03:35:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:58,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:59,142 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:35:59,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1312#false} is VALID [2022-02-21 03:35:59,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1311#true} #44#return; {1323#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:59,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:59,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {1332#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:59,709 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1409#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1331#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:59,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {1409#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} assume true; {1409#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:35:59,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {1416#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {1409#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:35:59,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1416#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} is VALID [2022-02-21 03:35:59,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1420#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} is VALID [2022-02-21 03:35:59,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1326#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1424#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} is VALID [2022-02-21 03:35:59,715 INFO L272 TraceCheckUtils]: 5: Hoare triple {1311#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1311#true} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {1311#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {1311#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1311#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1311#true} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1311#true} is VALID [2022-02-21 03:35:59,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {1311#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1311#true} is VALID [2022-02-21 03:35:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:59,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759953178] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:59,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:59,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-21 03:35:59,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879640820] [2022-02-21 03:35:59,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:59,717 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2022-02-21 03:35:59,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:59,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395216459] [2022-02-21 03:35:59,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:59,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:59,757 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:36:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:36:01,004 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:01,533 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2022-02-21 03:36:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:36:01,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:01,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:01,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 130 transitions. [2022-02-21 03:36:01,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 60 states and 77 transitions. [2022-02-21 03:36:01,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:36:01,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:36:01,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 77 transitions. [2022-02-21 03:36:01,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:01,612 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2022-02-21 03:36:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 77 transitions. [2022-02-21 03:36:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2022-02-21 03:36:01,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:01,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,620 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,620 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,621 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,638 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:01,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:01,639 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:01,640 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,644 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:01,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:01,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-02-21 03:36:01,646 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:01,646 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:01,646 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:01,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:36:01,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:01,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:01,647 INFO L791 eck$LassoCheckResult]: Stem: 1553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 1564#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1581#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1597#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1583#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1596#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1595#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 1572#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1589#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1571#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 1573#recFINAL assume true; 1588#recEXIT >#42#return; 1585#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 1584#recFINAL assume true; 1582#recEXIT >#44#return; 1555#L38-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 1556#L38-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 1557#L30-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1565#L30-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1566#L34 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1559#L38 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1560#recENTRY [2022-02-21 03:36:01,647 INFO L793 eck$LassoCheckResult]: Loop: 1560#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1570#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 1558#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1560#recENTRY [2022-02-21 03:36:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2022-02-21 03:36:01,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361687519] [2022-02-21 03:36:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,693 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2022-02-21 03:36:01,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228190119] [2022-02-21 03:36:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,706 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2022-02-21 03:36:01,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944085293] [2022-02-21 03:36:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,767 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:11,269 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:11,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:11,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:11,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:11,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:11,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:11,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:11,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration5_Lasso [2022-02-21 03:36:11,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:11,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:11,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,546 WARN L259 bleTransFormulaUtils]: 8 quantified variables [2022-02-21 03:36:11,547 WARN L259 bleTransFormulaUtils]: 8 quantified variables [2022-02-21 03:36:11,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:11,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:12,231 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:12,231 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:36:12,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:36:12,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,286 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:36:12,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:36:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,326 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:36:12,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,353 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:36:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,354 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:36:12,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:12,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:12,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:12,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,387 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:36:12,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,415 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:36:12,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,455 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:36:12,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:36:12,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:36:12,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,482 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:36:12,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,506 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:36:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,507 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:36:12,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,547 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:36:12,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,549 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:36:12,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:36:12,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,574 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:36:12,576 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:36:12,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:36:12,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,601 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:36:12,602 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:36:12,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:12,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:12,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,627 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:36:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,628 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:36:12,629 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:36:12,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,652 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:36:12,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,653 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:36:12,654 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:36:12,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,677 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:36:12,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,678 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:36:12,679 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:36:12,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,706 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:36:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,707 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:36:12,708 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:36:12,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,731 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:36:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,732 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:36:12,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,756 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:36:12,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:36:12,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,797 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:36:12,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 03:36:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,823 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:36:12,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:36:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,848 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:36:12,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:36:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,883 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:36:12,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:36:12,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,913 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:36:12,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 03:36:12,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,940 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:36:12,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,965 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:36:12,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:12,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 03:36:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,989 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:36:12,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:12,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:12,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:12,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:12,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:12,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:12,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:12,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:12,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:36:13,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,014 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:36:13,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 03:36:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,040 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:36:13,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 03:36:13,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,066 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 03:36:13,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,094 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:36:13,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,124 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:36:13,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 03:36:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,150 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:36:13,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:13,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:13,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:13,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:36:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,175 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:36:13,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:13,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:13,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-02-21 03:36:13,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,216 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:36:13,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:13,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:13,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 03:36:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,260 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:36:13,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:13,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:13,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 03:36:13,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,295 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:36:13,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:13,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:13,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:13,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 03:36:13,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,322 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:36:13,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:13,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:13,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:13,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:13,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:13,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:13,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:13,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:13,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:36:13,339 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:36:13,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,340 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 03:36:13,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:13,352 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:13,352 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:13,352 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2022-02-21 03:36:13,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:36:13,374 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:13,377 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:36:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:13,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {1991#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1991#unseeded} is VALID [2022-02-21 03:36:13,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1991#unseeded} is VALID [2022-02-21 03:36:13,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,616 INFO L272 TraceCheckUtils]: 5: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,635 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:13,636 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2029#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1991#unseeded} #44#return; {1991#unseeded} is VALID [2022-02-21 03:36:13,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1991#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {1991#unseeded} is VALID [2022-02-21 03:36:13,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {1991#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {1991#unseeded} is VALID [2022-02-21 03:36:13,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:13,638 INFO L272 TraceCheckUtils]: 21: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1991#unseeded} is VALID [2022-02-21 03:36:13,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:13,830 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:13,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:13,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {1994#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2078#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:13,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2078#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2082#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:13,917 INFO L272 TraceCheckUtils]: 2: Hoare triple {2082#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2009#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:13,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:13,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:13,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:14,035 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:14,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:14,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,037 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:14,038 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:14,038 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,038 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:14,038 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:14,039 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,046 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:14,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,047 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:14,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {1991#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1991#unseeded} is VALID [2022-02-21 03:36:14,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1991#unseeded} is VALID [2022-02-21 03:36:14,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,245 INFO L272 TraceCheckUtils]: 5: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,248 INFO L272 TraceCheckUtils]: 8: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,250 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2180#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1991#unseeded} #44#return; {1991#unseeded} is VALID [2022-02-21 03:36:14,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {1991#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {1991#unseeded} is VALID [2022-02-21 03:36:14,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {1991#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {1991#unseeded} is VALID [2022-02-21 03:36:14,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,253 INFO L272 TraceCheckUtils]: 21: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1991#unseeded} is VALID [2022-02-21 03:36:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:14,421 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:14,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:14,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {1994#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2229#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:14,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2233#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:14,516 INFO L272 TraceCheckUtils]: 2: Hoare triple {2233#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2009#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:14,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:14,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:14,633 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:14,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:14,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:14,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:14,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:14,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:14,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:14,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:14,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:14,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:14,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:14,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:14,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:14,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,651 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:14,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:14,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,653 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:14,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {1991#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1991#unseeded} is VALID [2022-02-21 03:36:14,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1991#unseeded} is VALID [2022-02-21 03:36:14,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,833 INFO L272 TraceCheckUtils]: 5: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,836 INFO L272 TraceCheckUtils]: 8: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,838 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:14,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2331#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1991#unseeded} #44#return; {1991#unseeded} is VALID [2022-02-21 03:36:14,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1991#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {1991#unseeded} is VALID [2022-02-21 03:36:14,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1991#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {1991#unseeded} is VALID [2022-02-21 03:36:14,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1991#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1991#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1991#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1991#unseeded} is VALID [2022-02-21 03:36:14,842 INFO L272 TraceCheckUtils]: 21: Hoare triple {1991#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1991#unseeded} is VALID [2022-02-21 03:36:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:15,010 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:15,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:15,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1994#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2380#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:15,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {2380#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2384#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:15,109 INFO L272 TraceCheckUtils]: 2: Hoare triple {2384#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2009#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:15,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:15,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:15,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,129 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:15,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:15,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 68 states and 78 transitions. Complement of second has 15 states. [2022-02-21 03:36:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:15,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:15,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:15,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:15,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:15,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:15,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:15,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:15,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:15,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2022-02-21 03:36:15,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:15,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:15,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:15,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:15,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:15,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:15,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:15,271 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:15,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:15,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:15,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:15,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:15,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:15,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:15,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:15,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:15,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:15,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:15,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:15,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:15,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:15,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:15,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:15,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:15,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,279 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-21 03:36:15,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:15,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:15,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 03:36:15,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:15,282 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:15,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2022-02-21 03:36:15,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:15,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:15,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:15,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:15,283 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:15,283 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:15,283 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:15,283 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:15,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:15,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:15,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:15,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:15 BoogieIcfgContainer [2022-02-21 03:36:15,288 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:15,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:15,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:15,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:15,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:46" (3/4) ... [2022-02-21 03:36:15,290 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:15,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:15,291 INFO L158 Benchmark]: Toolchain (without parser) took 29567.27ms. Allocated memory was 104.9MB in the beginning and 262.1MB in the end (delta: 157.3MB). Free memory was 74.2MB in the beginning and 195.5MB in the end (delta: -121.3MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,291 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:15,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.62ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 81.1MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.26ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,292 INFO L158 Benchmark]: Boogie Preprocessor took 24.53ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 78.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,292 INFO L158 Benchmark]: RCFGBuilder took 410.20ms. Allocated memory is still 104.9MB. Free memory was 78.2MB in the beginning and 64.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,292 INFO L158 Benchmark]: BuchiAutomizer took 28875.54ms. Allocated memory was 104.9MB in the beginning and 262.1MB in the end (delta: 157.3MB). Free memory was 64.8MB in the beginning and 195.5MB in the end (delta: -130.7MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-02-21 03:36:15,292 INFO L158 Benchmark]: Witness Printer took 2.10ms. Allocated memory is still 262.1MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:15,293 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.16ms. Allocated memory is still 104.9MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.62ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 81.1MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.26ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.53ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 78.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.20ms. Allocated memory is still 104.9MB. Free memory was 78.2MB in the beginning and 64.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 28875.54ms. Allocated memory was 104.9MB in the beginning and 262.1MB in the end (delta: 157.3MB). Free memory was 64.8MB in the beginning and 195.5MB in the end (delta: -130.7MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 2.10ms. Allocated memory is still 262.1MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 24.3s. Construction of modules took 0.5s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 80 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital393 mio100 ax100 hnf100 lsp98 ukn36 mio100 lsp28 div100 bol100 ite100 ukn100 eq158 hnf96 smp100 dnf507 smp77 tf100 neg84 sie160 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 8 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 44 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:15,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-02-21 03:36:15,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE