./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.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_ex5.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 b834abf8dc1317d8271c7246f1223cb53b92d1ccf9f4021ff5d970b2c79106ab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:48,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:48,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:48,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:48,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:48,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:48,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:48,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:48,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:48,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:48,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:48,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:48,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:48,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:48,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:48,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:48,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:48,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:48,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:48,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:48,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:48,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:48,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:48,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:48,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:48,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:48,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:48,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:48,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:48,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:48,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:48,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:48,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:48,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:48,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:48,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:48,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:48,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:48,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:48,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:48,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:48,650 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:48,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:48,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:48,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:48,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:48,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:48,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:48,685 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:48,685 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:48,685 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:48,685 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:48,686 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:48,686 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:48,686 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:48,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:48,687 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:48,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:48,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:48,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:48,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:48,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:48,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:48,688 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:48,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:48,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:48,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:48,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:48,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:48,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:48,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:48,690 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 -> b834abf8dc1317d8271c7246f1223cb53b92d1ccf9f4021ff5d970b2c79106ab [2022-02-21 03:35:48,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:48,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:48,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:48,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:48,955 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:48,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2022-02-21 03:35:49,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4771cfc/7cf9e8c14a6040ad821105f156d6c447/FLAGacc4f790f [2022-02-21 03:35:49,450 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:49,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2022-02-21 03:35:49,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4771cfc/7cf9e8c14a6040ad821105f156d6c447/FLAGacc4f790f [2022-02-21 03:35:49,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4771cfc/7cf9e8c14a6040ad821105f156d6c447 [2022-02-21 03:35:49,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:49,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:49,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:49,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:49,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:49,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:49" (1/1) ... [2022-02-21 03:35:49,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da1a0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:49, skipping insertion in model container [2022-02-21 03:35:49,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:49" (1/1) ... [2022-02-21 03:35:49,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:49,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:49,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:49,697 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:49,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:49,726 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:49,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:49 WrapperNode [2022-02-21 03:35:49,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:49,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:49,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:49,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:49,734 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:49" (1/1) ... [2022-02-21 03:35:49,740 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:49" (1/1) ... [2022-02-21 03:35:49,760 INFO L137 Inliner]: procedures = 12, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-02-21 03:35:49,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:49,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:49,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:49,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:49,768 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:49" (1/1) ... [2022-02-21 03:35:49,768 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:49" (1/1) ... [2022-02-21 03:35:49,780 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:49" (1/1) ... [2022-02-21 03:35:49,781 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:49" (1/1) ... [2022-02-21 03:35:49,794 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:49" (1/1) ... [2022-02-21 03:35:49,798 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:49" (1/1) ... [2022-02-21 03:35:49,799 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:49" (1/1) ... [2022-02-21 03:35:49,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:49,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:49,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:49,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:49,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:49" (1/1) ... [2022-02-21 03:35:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,849 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:49,867 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:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:35:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:35:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:35:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:35:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:49,976 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:49,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:50,320 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:50,329 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:50,331 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:35:50,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:50 BoogieIcfgContainer [2022-02-21 03:35:50,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:50,337 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:50,337 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:50,341 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:50,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:50,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:49" (1/3) ... [2022-02-21 03:35:50,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f4ea7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:50, skipping insertion in model container [2022-02-21 03:35:50,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:50,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:49" (2/3) ... [2022-02-21 03:35:50,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f4ea7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:50, skipping insertion in model container [2022-02-21 03:35:50,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:50,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:50" (3/3) ... [2022-02-21 03:35:50,345 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5.i [2022-02-21 03:35:50,398 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:50,399 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:50,399 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:50,399 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:50,399 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:50,399 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:50,399 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:50,400 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:50,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:35:50,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:50,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,454 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:50,454 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:50,455 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:50,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:35:50,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:50,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:50,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:50,467 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 14#L63true assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 12#L63-2true assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 9#L66true call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 17#fENTRYtrue [2022-02-21 03:35:50,468 INFO L793 eck$LassoCheckResult]: Loop: 17#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 23#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 20#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 18#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 6#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 13#gFINALtrue assume true; 22#gEXITtrue >#37#return; 10#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 17#fENTRYtrue [2022-02-21 03:35:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2022-02-21 03:35:50,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:50,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082964348] [2022-02-21 03:35:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,704 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2022-02-21 03:35:50,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:50,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8275627] [2022-02-21 03:35:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:50,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {36#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:50,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:50,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:50,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {29#false} is VALID [2022-02-21 03:35:50,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {28#true} is VALID [2022-02-21 03:35:50,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:50,960 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {35#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:50,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {36#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:50,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:50,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:50,964 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {29#false} is VALID [2022-02-21 03:35:50,965 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {29#false} is VALID [2022-02-21 03:35:50,966 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:50,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:50,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8275627] [2022-02-21 03:35:50,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8275627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:50,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:50,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:35:50,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913641042] [2022-02-21 03:35:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:50,973 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:50,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:35:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:35:51,005 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:51,245 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-21 03:35:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:35:51,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:51,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:51,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-02-21 03:35:51,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:51,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2022-02-21 03:35:51,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:35:51,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:35:51,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-02-21 03:35:51,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:51,281 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:35:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-02-21 03:35:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:35:51,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:51,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:51,309 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:51,310 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:51,312 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:35:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:35:51,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:51,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:51,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 17 states and 20 transitions. [2022-02-21 03:35:51,314 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 17 states and 20 transitions. [2022-02-21 03:35:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:51,316 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:35:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:35:51,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:51,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:51,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:51,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:35:51,320 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:35:51,320 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:35:51,320 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:51,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:35:51,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:51,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:51,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:51,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:51,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:51,322 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 75#L63 assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 73#L63-2 assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 70#L66 call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 71#fENTRY [2022-02-21 03:35:51,323 INFO L793 eck$LassoCheckResult]: Loop: 71#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 78#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 65#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 79#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 66#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 79#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 67#gFINAL assume true; 74#gEXIT >#41#return; 76#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 77#gFINAL assume true; 80#gEXIT >#37#return; 72#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 71#fENTRY [2022-02-21 03:35:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2022-02-21 03:35:51,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:51,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145292099] [2022-02-21 03:35:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:51,358 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2022-02-21 03:35:51,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:51,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983877405] [2022-02-21 03:35:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,572 INFO L272 TraceCheckUtils]: 2: Hoare triple {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:51,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,577 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,579 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2022-02-21 03:35:51,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {120#true} is VALID [2022-02-21 03:35:51,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:51,582 INFO L272 TraceCheckUtils]: 2: Hoare triple {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:51,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,585 INFO L272 TraceCheckUtils]: 5: Hoare triple {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:51,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:51,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,588 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,590 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2022-02-21 03:35:51,591 INFO L272 TraceCheckUtils]: 13: Hoare triple {121#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {121#false} is VALID [2022-02-21 03:35:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:51,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:51,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983877405] [2022-02-21 03:35:51,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983877405] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:51,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133463703] [2022-02-21 03:35:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:51,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,595 INFO L229 MonitoredProcess]: Starting monitored process 2 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:51,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:35:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:35:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:51,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:35:54,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {120#true} is VALID [2022-02-21 03:35:54,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {149#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} is VALID [2022-02-21 03:35:54,664 INFO L272 TraceCheckUtils]: 2: Hoare triple {149#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {153#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:54,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:54,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {160#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:54,667 INFO L272 TraceCheckUtils]: 5: Hoare triple {160#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {153#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:54,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {167#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} is VALID [2022-02-21 03:35:54,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {171#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:54,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume true; {171#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:54,673 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {171#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} {160#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} #41#return; {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:54,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:54,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} assume true; {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:54,679 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {178#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} {149#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} #37#return; {121#false} is VALID [2022-02-21 03:35:54,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {121#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {121#false} is VALID [2022-02-21 03:35:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:54,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:55,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {121#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {121#false} is VALID [2022-02-21 03:35:55,418 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2022-02-21 03:35:55,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:55,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:55,421 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {206#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:55,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:55,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(or (not (< |g_#t~mem5| 0)) (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:55,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {216#(or (not (< |g_#t~mem5| 0)) (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0))} is VALID [2022-02-21 03:35:55,424 INFO L272 TraceCheckUtils]: 5: Hoare triple {206#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {220#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:35:55,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {206#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} is VALID [2022-02-21 03:35:55,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {224#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:55,434 INFO L272 TraceCheckUtils]: 2: Hoare triple {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {228#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:35:55,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:55,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {120#true} is VALID [2022-02-21 03:35:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:55,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133463703] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:55,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:55,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2022-02-21 03:35:55,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937504664] [2022-02-21 03:35:55,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:55,439 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:55,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=298, Unknown=3, NotChecked=0, Total=380 [2022-02-21 03:35:55,442 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:56,710 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:35:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:56,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:56,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:56,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:56,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2022-02-21 03:35:56,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:35:56,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:35:56,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:56,758 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-21 03:35:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:35:56,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:56,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:56,760 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:56,761 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:56,762 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:35:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:56,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:56,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 20 states and 23 transitions. [2022-02-21 03:35:56,764 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 20 states and 23 transitions. [2022-02-21 03:35:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:56,765 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:35:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:56,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:56,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:56,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-21 03:35:56,768 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-21 03:35:56,768 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-21 03:35:56,768 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:56,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:35:56,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:56,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:56,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:56,770 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:56,770 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:56,771 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 269#L63 assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 267#L63-2 assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 263#L66 call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 264#fENTRY [2022-02-21 03:35:56,771 INFO L793 eck$LassoCheckResult]: Loop: 264#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 272#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 259#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 273#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 258#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 260#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 273#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 258#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 260#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 273#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 258#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 261#gFINAL assume true; 268#gEXIT >#41#return; 270#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 271#gFINAL assume true; 277#gEXIT >#41#return; 275#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 276#gFINAL assume true; 274#gEXIT >#37#return; 262#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 264#fENTRY [2022-02-21 03:35:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2022-02-21 03:35:56,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:56,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618851741] [2022-02-21 03:35:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,807 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2022-02-21 03:35:56,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:56,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128183968] [2022-02-21 03:35:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2022-02-21 03:35:56,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:56,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87541432] [2022-02-21 03:35:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:56,911 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:03,704 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:03,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:03,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:03,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:03,705 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:03,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:03,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:03,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration3_Lasso [2022-02-21 03:36:03,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:03,706 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:03,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:03,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,034 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 03:36:04,036 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 03:36:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,043 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:04,045 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:04,047 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:04,048 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:04,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,052 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:04,054 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:04,813 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:04,816 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:04,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,819 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:36:04,820 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:36:04,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:36:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,885 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:36:04,886 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:36:04,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,913 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:36:04,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,914 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:36:04,915 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:36:04,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:36:04,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,941 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:36:04,942 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:36:04,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,974 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:36:04,975 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:36:04,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:04,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:36:05,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,004 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:05,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:05,072 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:05,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,107 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:36:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:05,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,139 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:36:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,141 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:05,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:05,172 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:05,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:05,206 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:05,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:36:05,233 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:05,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:36:05,268 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:05,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,294 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:36:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,295 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:36:05,297 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:05,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,323 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:36:05,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,324 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:36:05,326 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:05,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:36:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,350 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:36:05,353 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:05,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,377 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:36:05,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:36:05,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,405 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:36:05,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:36:05,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,432 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:36:05,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,461 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:36:05,463 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:05,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,490 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:36:05,496 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:05,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,522 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:36:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,523 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:36:05,526 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:05,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,568 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:36:05,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,569 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:36:05,571 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:05,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,596 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:36:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,597 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:36:05,599 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:05,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,623 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:36:05,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,624 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:36:05,626 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:05,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:36:05,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,652 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:36:05,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:05,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,681 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:36:05,691 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:05,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,716 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:36:05,718 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:05,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,742 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:36:05,743 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:36:05,744 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:05,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:36:05,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,770 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:36:05,773 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:05,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,826 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:36:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,828 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,840 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:05,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:36:05,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,870 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:36:05,872 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:05,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:05,918 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:05,918 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,931 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:05,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:36:05,964 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:05,964 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:05,965 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2022-02-21 03:36:05,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,000 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:06,006 INFO L390 LassoCheck]: Loop: "~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v;" "assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8;" "call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8;" "call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;" "assume true;" >"#41#return;" "~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset;" "assume true;" >"#41#return;" "~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset;" "assume true;" >"#37#return;" "call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);"< [2022-02-21 03:36:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:06,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {327#unseeded} is VALID [2022-02-21 03:36:06,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; {327#unseeded} is VALID [2022-02-21 03:36:06,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#unseeded} assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; {327#unseeded} is VALID [2022-02-21 03:36:06,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#unseeded} assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {327#unseeded} is VALID [2022-02-21 03:36:06,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#unseeded} call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1); {327#unseeded} is VALID [2022-02-21 03:36:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:36:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:06,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(>= oldRank0 (+ (* 2 |f_#in~v|) 1))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {362#(<= (+ f_~v 1) (div (- oldRank0) (- 2)))} is VALID [2022-02-21 03:36:06,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(<= (+ f_~v 1) (div (- oldRank0) (- 2)))} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {366#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} is VALID [2022-02-21 03:36:06,717 INFO L272 TraceCheckUtils]: 2: Hoare triple {366#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,718 INFO L272 TraceCheckUtils]: 5: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,719 INFO L272 TraceCheckUtils]: 8: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume true; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,722 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {370#(<= |old(oldRank0)| oldRank0)} {370#(<= |old(oldRank0)| oldRank0)} #41#return; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume true; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,723 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {370#(<= |old(oldRank0)| oldRank0)} {370#(<= |old(oldRank0)| oldRank0)} #41#return; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {370#(<= |old(oldRank0)| oldRank0)} assume true; {370#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,725 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {370#(<= |old(oldRank0)| oldRank0)} {366#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} #37#return; {366#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} is VALID [2022-02-21 03:36:06,726 INFO L272 TraceCheckUtils]: 19: Hoare triple {366#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {345#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |f_#in~v|) 1))))} is VALID [2022-02-21 03:36:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:36:06,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:06,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:06,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:36:06,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 63 states and 72 transitions. Complement of second has 15 states. [2022-02-21 03:36:06,933 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:06,934 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:06,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:06,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:06,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 72 transitions. [2022-02-21 03:36:06,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:06,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,946 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 23 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:06,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:06,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:06,956 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:06,956 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 72 transitions. cyclomatic complexity: 12 [2022-02-21 03:36:06,958 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:06,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:06,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:06,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:06,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:06,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 letters. Loop has 3 letters. [2022-02-21 03:36:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:36:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 63 letters. Loop has 63 letters. [2022-02-21 03:36:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:36:06,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:06,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. Loop has 20 letters. [2022-02-21 03:36:06,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:06,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:06,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:06,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:06,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:06,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 8 letters. Loop has 3 letters. [2022-02-21 03:36:06,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:06,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:06,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 9 letters. Loop has 3 letters. [2022-02-21 03:36:06,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:06,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:06,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 10 letters. Loop has 3 letters. [2022-02-21 03:36:06,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:06,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 20 letters. [2022-02-21 03:36:06,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:06,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 20 letters. [2022-02-21 03:36:06,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:36:06,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 7 letters. Loop has 20 letters. [2022-02-21 03:36:06,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:36:06,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:06,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:06,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:06,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:06,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:07,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 20 letters. [2022-02-21 03:36:07,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:07,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 72 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,009 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 03:36:07,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:36:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2022-02-21 03:36:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. cyclomatic complexity: 12 [2022-02-21 03:36:07,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2022-02-21 03:36:07,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:36:07,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:36:07,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2022-02-21 03:36:07,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:07,031 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-02-21 03:36:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2022-02-21 03:36:07,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-02-21 03:36:07,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:07,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 47 transitions. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:07,041 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 47 transitions. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:07,042 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:07,042 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:07,052 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-21 03:36:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-21 03:36:07,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:07,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:07,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Second operand 40 states and 47 transitions. [2022-02-21 03:36:07,054 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Second operand 40 states and 47 transitions. [2022-02-21 03:36:07,054 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:07,064 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-02-21 03:36:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-02-21 03:36:07,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:07,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:07,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:07,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-21 03:36:07,072 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:36:07,072 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:36:07,072 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:07,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:36:07,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,073 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:07,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:07,074 INFO L791 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 517#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 522#L63 assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 521#L63-2 assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 514#L66 call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 518#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 527#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 507#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 524#gENTRY [2022-02-21 03:36:07,074 INFO L793 eck$LassoCheckResult]: Loop: 524#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 506#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 508#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 524#gENTRY [2022-02-21 03:36:07,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2022-02-21 03:36:07,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195615219] [2022-02-21 03:36:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,139 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2022-02-21 03:36:07,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760221394] [2022-02-21 03:36:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,159 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2022-02-21 03:36:07,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073851711] [2022-02-21 03:36:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,207 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:10,047 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:10,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:10,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:10,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:10,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:10,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:10,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:10,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration4_Lasso [2022-02-21 03:36:10,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:10,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:10,052 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:10,056 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:10,057 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:10,250 WARN L259 bleTransFormulaUtils]: 4 quantified variables [2022-02-21 03:36:10,252 WARN L259 bleTransFormulaUtils]: 4 quantified variables [2022-02-21 03:36:10,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:36:10,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:36:10,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:36:10,262 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:10,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:36:10,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:36:10,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,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:36:10,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:36:10,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:36:10,276 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:10,278 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:10,280 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:10,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:36:10,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:36:10,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:10,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:10,289 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:10,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:10,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:10,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:10,296 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:10,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:10,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:10,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:10,310 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:10,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,313 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:10,316 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:10,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:10,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:10,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:10,322 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:10,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:10,326 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:10,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:10,329 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:10,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:10,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:10,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:10,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:10,338 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:10,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:10,341 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:10,349 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:10,352 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:10,354 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:10,357 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:10,359 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:10,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,363 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:10,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,368 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:10,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:10,952 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,956 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:36:10,958 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:10,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,983 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:10,984 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:10,985 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:10,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,017 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:11,018 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:11,019 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:11,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,050 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:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,052 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:11,053 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:11,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:11,090 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:11,090 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,091 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:11,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:11,095 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:11,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:11,101 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:11,101 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:36:11,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,124 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:11,128 INFO L390 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8;" "call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);"< [2022-02-21 03:36:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {769#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {769#unseeded} is VALID [2022-02-21 03:36:11,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; {769#unseeded} is VALID [2022-02-21 03:36:11,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#unseeded} assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; {769#unseeded} is VALID [2022-02-21 03:36:11,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {769#unseeded} assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {769#unseeded} is VALID [2022-02-21 03:36:11,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#unseeded} call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1); {769#unseeded} is VALID [2022-02-21 03:36:11,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#unseeded} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {769#unseeded} is VALID [2022-02-21 03:36:11,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {769#unseeded} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {769#unseeded} is VALID [2022-02-21 03:36:11,216 INFO L272 TraceCheckUtils]: 7: Hoare triple {769#unseeded} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {769#unseeded} is VALID [2022-02-21 03:36:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:36:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,352 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 0 case distinctions, treesize of input 39 treesize of output 23 [2022-02-21 03:36:11,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {813#(and (<= |g_#t~mem5| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| g_~p.base) g_~p.offset)) 1) oldRank0))} is VALID [2022-02-21 03:36:11,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#(and (<= |g_#t~mem5| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| g_~p.base) g_~p.offset)) 1) oldRank0))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {817#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:36:11,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {817#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) (div (+ (- 1) oldRank0) 2)))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {787#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) 1))))} is VALID [2022-02-21 03:36:11,385 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:11,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:11,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,395 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:36:11,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 57 states and 66 transitions. Complement of second has 15 states. [2022-02-21 03:36:11,488 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:11,488 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:11,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 66 transitions. [2022-02-21 03:36:11,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,491 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 34 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:11,491 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:11,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:11,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 66 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:11,493 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:11,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 57 letters. Loop has 57 letters. [2022-02-21 03:36:11,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 57 letters. Loop has 57 letters. [2022-02-21 03:36:11,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 57 letters. Loop has 57 letters. [2022-02-21 03:36:11,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:36:11,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 29 letters. Loop has 29 letters. [2022-02-21 03:36:11,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:36:11,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 66 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,507 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:36:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:36:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:11,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2022-02-21 03:36:11,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:36:11,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:36:11,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2022-02-21 03:36:11,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:11,514 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-21 03:36:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2022-02-21 03:36:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-21 03:36:11,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:11,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 48 transitions. Second operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:11,518 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 48 transitions. Second operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:11,518 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:11,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:11,523 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-21 03:36:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-21 03:36:11,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:11,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:11,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Second operand 40 states and 48 transitions. [2022-02-21 03:36:11,525 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Second operand 40 states and 48 transitions. [2022-02-21 03:36:11,525 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:11,528 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-21 03:36:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-21 03:36:11,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:11,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:11,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:11,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-02-21 03:36:11,531 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-21 03:36:11,531 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-21 03:36:11,531 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:11,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2022-02-21 03:36:11,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,533 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:11,533 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:11,533 INFO L791 eck$LassoCheckResult]: Stem: 909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 917#L63 assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 916#L63-2 assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 907#L66 call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 911#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 923#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 926#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 927#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 933#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 903#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 935#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 934#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 904#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 935#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 902#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 905#gFINAL assume true; 937#gEXIT >#41#return; 918#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 919#gFINAL assume true; 932#gEXIT >#41#return; 931#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 930#gFINAL assume true; 928#gEXIT >#37#return; 906#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 908#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 925#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 901#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 920#gENTRY [2022-02-21 03:36:11,533 INFO L793 eck$LassoCheckResult]: Loop: 920#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 899#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 900#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 920#gENTRY [2022-02-21 03:36:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2022-02-21 03:36:11,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:11,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783670121] [2022-02-21 03:36:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,602 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:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:36:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,844 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,848 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,851 INFO L272 TraceCheckUtils]: 2: Hoare triple {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,854 INFO L272 TraceCheckUtils]: 5: Hoare triple {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,858 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,860 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} assume true; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,863 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} {1226#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {1243#(<= f_~v 0)} is VALID [2022-02-21 03:36:11,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1224#true} is VALID [2022-02-21 03:36:11,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; {1224#true} is VALID [2022-02-21 03:36:11,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; {1224#true} is VALID [2022-02-21 03:36:11,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {1224#true} assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1224#true} is VALID [2022-02-21 03:36:11,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1); {1224#true} is VALID [2022-02-21 03:36:11,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1224#true} is VALID [2022-02-21 03:36:11,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {1224#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1226#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:36:11,866 INFO L272 TraceCheckUtils]: 7: Hoare triple {1226#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,869 INFO L272 TraceCheckUtils]: 10: Hoare triple {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,872 INFO L272 TraceCheckUtils]: 13: Hoare triple {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:11,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:11,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem5|) (= |g_#in~p.base| g_~p.base))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:11,875 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:11,878 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1248#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #41#return; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} assume true; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:11,880 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} {1226#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {1243#(<= f_~v 0)} is VALID [2022-02-21 03:36:11,881 INFO L272 TraceCheckUtils]: 24: Hoare triple {1243#(<= f_~v 0)} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {1244#(<= (+ |f_#in~v| 1) 0)} is VALID [2022-02-21 03:36:11,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {1244#(<= (+ |f_#in~v| 1) 0)} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1245#(<= (+ f_~v 1) 0)} is VALID [2022-02-21 03:36:11,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#(<= (+ f_~v 1) 0)} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1225#false} is VALID [2022-02-21 03:36:11,883 INFO L272 TraceCheckUtils]: 27: Hoare triple {1225#false} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1225#false} is VALID [2022-02-21 03:36:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:36:11,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:11,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783670121] [2022-02-21 03:36:11,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783670121] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:11,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215477683] [2022-02-21 03:36:11,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,888 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-02-21 03:36:11,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:11,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:11,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-21 03:36:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:12,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:36:16,315 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 17 treesize of output 9 [2022-02-21 03:36:16,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1224#true} is VALID [2022-02-21 03:36:16,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; {1224#true} is VALID [2022-02-21 03:36:16,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; {1224#true} is VALID [2022-02-21 03:36:16,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {1224#true} assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1224#true} is VALID [2022-02-21 03:36:16,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1); {1224#true} is VALID [2022-02-21 03:36:16,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1224#true} is VALID [2022-02-21 03:36:16,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {1224#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1288#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} is VALID [2022-02-21 03:36:16,367 INFO L272 TraceCheckUtils]: 7: Hoare triple {1288#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1292#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:16,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:16,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:16,370 INFO L272 TraceCheckUtils]: 10: Hoare triple {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1292#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:16,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {1292#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:16,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1247#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:16,373 INFO L272 TraceCheckUtils]: 13: Hoare triple {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1292#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:16,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {1292#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1315#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} is VALID [2022-02-21 03:36:16,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {1315#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1319#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:16,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {1319#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume true; {1319#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:16,377 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1319#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} #41#return; {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:16,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:16,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} assume true; {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:16,401 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1326#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} {1299#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} #41#return; {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:16,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:16,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume true; {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:16,406 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1336#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} {1288#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} #37#return; {1243#(<= f_~v 0)} is VALID [2022-02-21 03:36:16,407 INFO L272 TraceCheckUtils]: 24: Hoare triple {1243#(<= f_~v 0)} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {1244#(<= (+ |f_#in~v| 1) 0)} is VALID [2022-02-21 03:36:16,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {1244#(<= (+ |f_#in~v| 1) 0)} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1245#(<= (+ f_~v 1) 0)} is VALID [2022-02-21 03:36:16,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#(<= (+ f_~v 1) 0)} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1225#false} is VALID [2022-02-21 03:36:16,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {1225#false} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1225#false} is VALID [2022-02-21 03:36:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:36:16,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:17,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {1225#false} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1225#false} is VALID [2022-02-21 03:36:17,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#(<= (+ f_~v 1) 0)} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1225#false} is VALID [2022-02-21 03:36:17,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {1244#(<= (+ |f_#in~v| 1) 0)} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1245#(<= (+ f_~v 1) 0)} is VALID [2022-02-21 03:36:17,936 INFO L272 TraceCheckUtils]: 24: Hoare triple {1243#(<= f_~v 0)} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {1244#(<= (+ |f_#in~v| 1) 0)} is VALID [2022-02-21 03:36:17,938 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} {1370#(or (<= 2 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)) (<= f_~v 0))} #37#return; {1243#(<= f_~v 0)} is VALID [2022-02-21 03:36:17,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} assume true; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:17,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:17,944 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1383#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1))} #41#return; {1259#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:17,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:17,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:17,946 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1396#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} #41#return; {1264#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:17,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:17,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1406#(or (not (< |g_#t~mem5| 0)) (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {1266#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:17,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1410#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1406#(or (not (< |g_#t~mem5| 0)) (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0))} is VALID [2022-02-21 03:36:17,949 INFO L272 TraceCheckUtils]: 13: Hoare triple {1396#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1410#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:36:17,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1414#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1396#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} is VALID [2022-02-21 03:36:17,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1414#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:17,952 INFO L272 TraceCheckUtils]: 10: Hoare triple {1383#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {1418#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:36:17,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {1422#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) (<= 2 (select (select |#memory_int| g_~p.base) g_~p.offset)))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {1383#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1))} is VALID [2022-02-21 03:36:17,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {1426#(or (<= 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {1422#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) (<= 2 (select (select |#memory_int| g_~p.base) g_~p.offset)))} is VALID [2022-02-21 03:36:17,955 INFO L272 TraceCheckUtils]: 7: Hoare triple {1370#(or (<= 2 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)) (<= f_~v 0))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1426#(or (<= 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1))} is VALID [2022-02-21 03:36:17,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1224#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1370#(or (<= 2 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)) (<= f_~v 0))} is VALID [2022-02-21 03:36:17,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1224#true} is VALID [2022-02-21 03:36:17,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1); {1224#true} is VALID [2022-02-21 03:36:17,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {1224#true} assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1224#true} is VALID [2022-02-21 03:36:17,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; {1224#true} is VALID [2022-02-21 03:36:17,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; {1224#true} is VALID [2022-02-21 03:36:17,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1224#true} is VALID [2022-02-21 03:36:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:17,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215477683] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:17,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:17,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 17] total 29 [2022-02-21 03:36:17,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696247408] [2022-02-21 03:36:17,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:17,960 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2022-02-21 03:36:17,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:17,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773221172] [2022-02-21 03:36:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:17,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:17,981 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:18,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:18,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-21 03:36:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=673, Unknown=4, NotChecked=0, Total=812 [2022-02-21 03:36:18,227 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 22 states have internal predecessors, (34), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:36:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:19,978 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-02-21 03:36:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:19,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 20 states have (on average 1.7) internal successors, (34), 22 states have internal predecessors, (34), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:36:20,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:20,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2022-02-21 03:36:20,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:20,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2022-02-21 03:36:20,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:36:20,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:36:20,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2022-02-21 03:36:20,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:20,600 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-02-21 03:36:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2022-02-21 03:36:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-02-21 03:36:20,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:20,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 58 transitions. Second operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:20,604 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 58 transitions. Second operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:20,604 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:20,605 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:20,609 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-02-21 03:36:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-02-21 03:36:20,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:20,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:20,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Second operand 46 states and 58 transitions. [2022-02-21 03:36:20,610 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Second operand 46 states and 58 transitions. [2022-02-21 03:36:20,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:20,615 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-02-21 03:36:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-02-21 03:36:20,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:20,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:20,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:20,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-02-21 03:36:20,618 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-21 03:36:20,618 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-21 03:36:20,619 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:20,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2022-02-21 03:36:20,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:20,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:20,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:20,620 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:20,620 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:20,620 INFO L791 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~short17#1, main_#t~mem18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(main_#t~nondet13#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet13#1;call write~int(main_#t~nondet14#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short17#1 := main_#t~mem15#1 < 0; 1528#L63 assume !main_#t~short17#1;call main_#t~mem16#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short17#1 := main_#t~mem16#1 < 0; 1527#L63-2 assume !main_#t~short17#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~short17#1;call main_#t~mem18#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 1518#L66 call main_#t~ret19#1.base, main_#t~ret19#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem18#1);< 1522#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1530#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1536#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1537#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 1544#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 1514#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1549#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 1546#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 1515#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1549#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 1546#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 1515#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1549#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 1513#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 1516#gFINAL assume true; 1551#gEXIT >#41#return; 1529#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 1523#gFINAL assume true; 1526#gEXIT >#41#return; 1538#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 1545#gFINAL assume true; 1543#gEXIT >#41#return; 1542#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset;havoc #t~malloc10.base, #t~malloc10.offset; 1541#gFINAL assume true; 1539#gEXIT >#37#return; 1517#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1519#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1532#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1512#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1533#gENTRY [2022-02-21 03:36:20,621 INFO L793 eck$LassoCheckResult]: Loop: 1533#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 1510#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 1511#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1533#gENTRY [2022-02-21 03:36:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2022-02-21 03:36:20,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:20,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497077941] [2022-02-21 03:36:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2022-02-21 03:36:20,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:20,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715772016] [2022-02-21 03:36:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,705 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2022-02-21 03:36:20,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:20,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690395854] [2022-02-21 03:36:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:20,783 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:40,651 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:40,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:40,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:40,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:40,651 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:40,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:40,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:40,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:40,651 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration6_Lasso [2022-02-21 03:36:40,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:40,651 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:40,659 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:40,661 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:40,663 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:40,664 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:40,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,667 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:40,669 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:40,671 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:40,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,680 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:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,693 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:40,695 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:40,696 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:40,699 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:40,701 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:40,703 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:40,705 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:40,707 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:40,708 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:40,710 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:40,712 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:40,714 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:40,715 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:40,717 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:40,719 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:40,720 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:40,723 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:40,725 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:40,727 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:40,736 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:40,739 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:40,740 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:40,743 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:40,744 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:40,746 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:40,748 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:40,749 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:40,756 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:40,758 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:40,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,761 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:40,763 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:40,765 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:40,767 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:40,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,773 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:40,775 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:41,258 WARN L259 bleTransFormulaUtils]: 12 quantified variables [2022-02-21 03:36:41,261 WARN L259 bleTransFormulaUtils]: 12 quantified variables [2022-02-21 03:36:41,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:41,289 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:41,290 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:41,611 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8