./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/memleaks_test18_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:36:11,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:36:11,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:36:11,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:36:11,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:36:11,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:36:11,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:36:11,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:36:11,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:36:11,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:36:11,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:36:11,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:36:11,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:36:11,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:36:11,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:36:11,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:36:11,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:36:11,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:36:11,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:36:11,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:36:11,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:36:11,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:36:11,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:36:11,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:36:11,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:36:11,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:36:11,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:36:11,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:36:11,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:36:11,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:36:11,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:36:11,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:36:11,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:36:11,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:36:11,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:36:11,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:36:11,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:36:11,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:36:11,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:36:11,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:36:11,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:36:11,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:36:11,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:36:11,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:36:11,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:36:11,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:36:11,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:36:11,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:36:11,251 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:36:11,251 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:36:11,252 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:36:11,252 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:36:11,253 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:36:11,253 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:36:11,253 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:36:11,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:36:11,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:36:11,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:36:11,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:36:11,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:36:11,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:36:11,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:36:11,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:36:11,258 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:36:11,258 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2022-02-21 04:36:11,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:36:11,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:36:11,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:36:11,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:36:11,536 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:36:11,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-02-21 04:36:11,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039c60d40/4d30402381784529a44936914e909bf9/FLAGa43b7f6ee [2022-02-21 04:36:12,077 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:36:12,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-02-21 04:36:12,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039c60d40/4d30402381784529a44936914e909bf9/FLAGa43b7f6ee [2022-02-21 04:36:12,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039c60d40/4d30402381784529a44936914e909bf9 [2022-02-21 04:36:12,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:36:12,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:36:12,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:12,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:36:12,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:36:12,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678e9f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12, skipping insertion in model container [2022-02-21 04:36:12,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:36:12,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:36:12,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:12,569 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:36:12,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:12,668 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:36:12,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12 WrapperNode [2022-02-21 04:36:12,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:12,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:12,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:36:12,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:36:12,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,725 INFO L137 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 67 [2022-02-21 04:36:12,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:12,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:36:12,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:36:12,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:36:12,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:36:12,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:36:12,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:36:12,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:36:12,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (1/1) ... [2022-02-21 04:36:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:12,800 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 04:36:12,811 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 04:36:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 04:36:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:36:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 04:36:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 04:36:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:36:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-21 04:36:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:36:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:36:12,915 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:36:12,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:36:13,135 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:36:13,140 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:36:13,141 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:36:13,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:13 BoogieIcfgContainer [2022-02-21 04:36:13,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:36:13,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:36:13,143 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:36:13,147 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:36:13,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:13,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:36:12" (1/3) ... [2022-02-21 04:36:13,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@338800d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:13, skipping insertion in model container [2022-02-21 04:36:13,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:13,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:12" (2/3) ... [2022-02-21 04:36:13,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@338800d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:13, skipping insertion in model container [2022-02-21 04:36:13,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:13,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:13" (3/3) ... [2022-02-21 04:36:13,152 INFO L388 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2.i [2022-02-21 04:36:13,191 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:36:13,192 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:36:13,192 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:36:13,192 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:36:13,192 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:36:13,192 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:36:13,192 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:36:13,193 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:36:13,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:13,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:13,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:13,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:13,248 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:13,248 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:13,249 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:36:13,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:13,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:13,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:13,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:13,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:13,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:13,260 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 14#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 7#L529true entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 8#L766true assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 12#L767-3true [2022-02-21 04:36:13,262 INFO L793 eck$LassoCheckResult]: Loop: 12#L767-3true assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 18#L526-1true assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 19#L529-1true entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 16#L769true assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 13#L767-2true entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 12#L767-3true [2022-02-21 04:36:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 04:36:13,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014181433] [2022-02-21 04:36:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {22#true} is VALID [2022-02-21 04:36:13,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {22#true} is VALID [2022-02-21 04:36:13,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; {24#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} is VALID [2022-02-21 04:36:13,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; {25#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))} is VALID [2022-02-21 04:36:13,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))} assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); {23#false} is VALID [2022-02-21 04:36:13,514 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 04:36:13,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:13,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014181433] [2022-02-21 04:36:13,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014181433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:13,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:13,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:36:13,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629222254] [2022-02-21 04:36:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:13,524 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2022-02-21 04:36:13,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808993912] [2022-02-21 04:36:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,624 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:13,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:14,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:14,030 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,156 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 04:36:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:36:14,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:14,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-02-21 04:36:14,171 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 04:36:14,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 20 states and 23 transitions. [2022-02-21 04:36:14,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:14,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:14,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-02-21 04:36:14,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:14,177 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-21 04:36:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-02-21 04:36:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2022-02-21 04:36:14,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:14,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,199 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,200 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,202 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 04:36:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 04:36:14,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 23 transitions. [2022-02-21 04:36:14,203 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 23 transitions. [2022-02-21 04:36:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,205 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 04:36:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 04:36:14,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:14,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 04:36:14,211 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 04:36:14,212 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 04:36:14,212 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:36:14,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-02-21 04:36:14,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:14,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,216 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:14,216 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:14,222 INFO L791 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 78#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 77#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 74#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 75#L767-3 [2022-02-21 04:36:14,222 INFO L793 eck$LassoCheckResult]: Loop: 75#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 79#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 82#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 81#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 80#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 75#L767-3 [2022-02-21 04:36:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2022-02-21 04:36:14,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734485127] [2022-02-21 04:36:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,266 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2022-02-21 04:36:14,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146936945] [2022-02-21 04:36:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,296 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2022-02-21 04:36:14,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491870450] [2022-02-21 04:36:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,337 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,975 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:36:14,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:36:14,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:36:14,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:36:14,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:36:14,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:14,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:36:14,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:36:14,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration2_Lasso [2022-02-21 04:36:14,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:36:14,977 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:36:14,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:15,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:16,022 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:36:16,026 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:36:16,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:36:16,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:16,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:36:16,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,071 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 04:36:16,072 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 04:36:16,073 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 04:36:16,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,137 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 04:36:16,146 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 04:36:16,147 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 04:36:16,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,203 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 04:36:16,204 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 04:36:16,205 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 04:36:16,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,269 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 04:36:16,274 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 04:36:16,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,283 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 04:36:16,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,322 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 04:36:16,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:16,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,347 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 04:36:16,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,392 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 04:36:16,395 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 04:36:16,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:16,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,438 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 04:36:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,440 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 04:36:16,441 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 04:36:16,443 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 04:36:16,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:36:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,476 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 04:36:16,476 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 04:36:16,478 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 04:36:16,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,522 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 04:36:16,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,523 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 04:36:16,525 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 04:36:16,525 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 04:36:16,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:36:16,599 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:36:16,599 INFO L444 ModelExtractionUtils]: 18 out of 40 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 04:36:16,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,625 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 04:36:16,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:36:16,703 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 04:36:16,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:36:16,723 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:36:16,724 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0#1, ULTIMATE.start_entry_point_~i~0#1) = 1*ULTIMATE.start_entry_point_~len~0#1 - 1*ULTIMATE.start_entry_point_~i~0#1 Supporting invariants [] [2022-02-21 04:36:16,754 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 04:36:16,788 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:36:16,794 INFO L390 LassoCheck]: Loop: "assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);" "entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1;" [2022-02-21 04:36:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:16,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:36:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:16,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:16,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {132#unseeded} is VALID [2022-02-21 04:36:16,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {132#unseeded} is VALID [2022-02-21 04:36:16,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#unseeded} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {132#unseeded} is VALID [2022-02-21 04:36:16,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#unseeded} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; {132#unseeded} is VALID [2022-02-21 04:36:16,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#unseeded} assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); {132#unseeded} is VALID [2022-02-21 04:36:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:16,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:16,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:16,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|))} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:16,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:16,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:16,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:16,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; {175#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~0#1|) |ULTIMATE.start_entry_point_~len~0#1|))) unseeded)} is VALID [2022-02-21 04:36:16,950 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 04:36:16,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:16,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:16,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:36:16,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2022-02-21 04:36:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:36:17,016 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:17,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 04:36:17,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:36:17,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,024 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 04:36:17,029 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:36:17,029 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,032 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:36:17,032 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 04:36:17,033 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:36:17,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:17,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:17,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:17,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:36:17,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:36:17,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:36:17,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:17,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:17,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:17,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:17,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:17,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:17,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 5 letters. [2022-02-21 04:36:17,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 04:36:17,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2022-02-21 04:36:17,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:17,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:17,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:17,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,062 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 04:36:17,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:17,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2022-02-21 04:36:17,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 04:36:17,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2022-02-21 04:36:17,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:36:17,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:36:17,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-02-21 04:36:17,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:17,076 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:36:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-02-21 04:36:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 04:36:17,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:17,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,078 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,079 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,081 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,083 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:36:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:36:17,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:36:17,087 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:36:17,088 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,090 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:36:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:36:17,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:17,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 04:36:17,092 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:36:17,092 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:36:17,092 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:36:17,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:36:17,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,094 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:17,094 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:17,094 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 240#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 237#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 238#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 239#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 244#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 247#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 245#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 234#L769-1 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 235#L774-3 [2022-02-21 04:36:17,094 INFO L793 eck$LassoCheckResult]: Loop: 235#L774-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 236#L774-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 235#L774-3 [2022-02-21 04:36:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2022-02-21 04:36:17,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159513142] [2022-02-21 04:36:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,120 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2022-02-21 04:36:17,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352331496] [2022-02-21 04:36:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,136 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:17,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2022-02-21 04:36:17,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074932254] [2022-02-21 04:36:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {334#true} is VALID [2022-02-21 04:36:17,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {334#true} is VALID [2022-02-21 04:36:17,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {334#true} is VALID [2022-02-21 04:36:17,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#true} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:17,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {337#(<= (+ |ULTIMATE.start_entry_point_~j~0#1| 1) 0)} is VALID [2022-02-21 04:36:17,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(<= (+ |ULTIMATE.start_entry_point_~j~0#1| 1) 0)} assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; {335#false} is VALID [2022-02-21 04:36:17,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; {335#false} is VALID [2022-02-21 04:36:17,190 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 04:36:17,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:17,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074932254] [2022-02-21 04:36:17,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074932254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:17,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:17,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:17,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230183854] [2022-02-21 04:36:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:17,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:17,230 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:17,292 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-21 04:36:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:36:17,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:17,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2022-02-21 04:36:17,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2022-02-21 04:36:17,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:36:17,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:36:17,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2022-02-21 04:36:17,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:17,327 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 04:36:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2022-02-21 04:36:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-02-21 04:36:17,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:17,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,330 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,330 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,330 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,331 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:36:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 04:36:17,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 04:36:17,334 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 04:36:17,335 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,339 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:36:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 04:36:17,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:17,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 04:36:17,341 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 04:36:17,341 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 04:36:17,341 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:36:17,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 04:36:17,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:17,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:17,344 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 374#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 371#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 372#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 373#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 375#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 382#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 380#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 378#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 376#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 377#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 381#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 379#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 368#L769-1 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 369#L774-3 [2022-02-21 04:36:17,344 INFO L793 eck$LassoCheckResult]: Loop: 369#L774-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 370#L774-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 369#L774-3 [2022-02-21 04:36:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2022-02-21 04:36:17,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85565859] [2022-02-21 04:36:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,367 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 04:36:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {489#true} is VALID [2022-02-21 04:36:17,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {489#true} is VALID [2022-02-21 04:36:17,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {489#true} is VALID [2022-02-21 04:36:17,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#true} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; {489#true} is VALID [2022-02-21 04:36:17,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#true} assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); {489#true} is VALID [2022-02-21 04:36:17,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {489#true} is VALID [2022-02-21 04:36:17,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#true} assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; {491#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} is VALID [2022-02-21 04:36:17,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {492#(and (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0))} is VALID [2022-02-21 04:36:17,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(and (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0))} assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); {490#false} is VALID [2022-02-21 04:36:17,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#false} entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; {490#false} is VALID [2022-02-21 04:36:17,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {490#false} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {490#false} is VALID [2022-02-21 04:36:17,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; {490#false} is VALID [2022-02-21 04:36:17,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#false} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {490#false} is VALID [2022-02-21 04:36:17,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; {490#false} is VALID [2022-02-21 04:36:17,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {490#false} is VALID [2022-02-21 04:36:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:17,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:17,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85565859] [2022-02-21 04:36:17,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85565859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:17,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:17,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:17,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246546301] [2022-02-21 04:36:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:17,429 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2022-02-21 04:36:17,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442877363] [2022-02-21 04:36:17,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,439 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:17,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:17,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:17,475 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:17,526 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 04:36:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:36:17,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:17,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2022-02-21 04:36:17,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:36:17,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2022-02-21 04:36:17,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 04:36:17,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 04:36:17,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2022-02-21 04:36:17,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:17,544 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-21 04:36:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2022-02-21 04:36:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-02-21 04:36:17,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:17,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,546 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,546 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,546 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,547 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-02-21 04:36:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-02-21 04:36:17,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 24 transitions. [2022-02-21 04:36:17,548 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 24 transitions. [2022-02-21 04:36:17,549 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:17,550 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-02-21 04:36:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-02-21 04:36:17,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:17,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:17,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:17,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 04:36:17,551 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 04:36:17,551 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 04:36:17,551 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:36:17,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-02-21 04:36:17,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,553 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:17,553 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:17,553 INFO L791 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 529#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 526#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 527#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 528#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 530#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 537#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 535#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 533#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 531#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 532#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 536#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 534#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 523#L769-1 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 524#L774-3 [2022-02-21 04:36:17,553 INFO L793 eck$LassoCheckResult]: Loop: 524#L774-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 525#L774-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 524#L774-3 [2022-02-21 04:36:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2022-02-21 04:36:17,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108475995] [2022-02-21 04:36:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,580 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2022-02-21 04:36:17,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88526393] [2022-02-21 04:36:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,598 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2022-02-21 04:36:17,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:17,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924948850] [2022-02-21 04:36:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:17,653 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:18,430 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:36:18,430 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:36:18,430 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:36:18,430 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:36:18,431 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:36:18,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:18,431 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:36:18,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:36:18,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration5_Lasso [2022-02-21 04:36:18,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:36:18,431 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:36:18,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,752 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:36:18,754 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:36:18,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 04:36:18,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 04:36:18,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 04:36:18,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 04:36:18,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:18,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 04:36:18,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 04:36:19,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:36:19,344 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:36:19,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,346 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 04:36:19,352 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 04:36:19,352 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 04:36:19,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,376 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 04:36:19,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,378 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 04:36:19,379 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 04:36:19,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:19,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,434 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 04:36:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,435 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 04:36:19,436 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 04:36:19,437 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 04:36:19,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,479 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 04:36:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,481 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 04:36:19,481 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 04:36:19,490 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 04:36:19,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,513 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 04:36:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,515 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 04:36:19,516 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 04:36:19,517 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 04:36:19,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:19,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,544 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 04:36:19,546 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 04:36:19,547 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 04:36:19,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,571 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 04:36:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,573 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 04:36:19,574 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 04:36:19,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:19,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:36:19,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,602 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 04:36:19,603 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 04:36:19,605 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 04:36:19,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,634 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 04:36:19,635 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 04:36:19,636 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 04:36:19,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,659 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 04:36:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,661 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 04:36:19,661 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 04:36:19,663 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 04:36:19,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:36:19,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,688 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 04:36:19,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 04:36:19,691 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 04:36:19,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:19,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,717 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 04:36:19,724 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 04:36:19,728 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 04:36:19,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,786 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 04:36:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,788 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 04:36:19,791 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 04:36:19,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,801 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 04:36:19,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,841 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 04:36:19,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,842 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 04:36:19,843 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 04:36:19,847 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 04:36:19,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,879 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 04:36:19,879 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 04:36:19,880 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 04:36:19,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,937 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 04:36:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,938 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 04:36:19,939 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 04:36:19,940 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 04:36:19,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:19,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:19,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,967 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 04:36:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,969 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 04:36:19,969 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 04:36:19,971 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 04:36:19,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:19,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:19,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:19,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:19,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:19,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:19,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:19,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:19,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:36:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:19,994 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 04:36:19,995 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 04:36:19,997 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 04:36:20,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:20,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:20,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:20,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:36:20,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,021 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 04:36:20,022 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 04:36:20,024 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 04:36:20,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:20,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:20,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:20,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:20,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,047 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 04:36:20,057 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 04:36:20,059 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 04:36:20,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:20,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:20,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,084 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 04:36:20,085 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 04:36:20,086 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 04:36:20,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:20,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:36:20,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,112 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 04:36:20,112 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 04:36:20,114 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 04:36:20,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:20,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:36:20,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,140 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 04:36:20,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 04:36:20,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:20,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:20,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:20,153 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 04:36:20,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,188 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 04:36:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,189 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 04:36:20,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:20,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,200 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 04:36:20,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,204 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:36:20,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,207 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 04:36:20,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 04:36:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,229 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 04:36:20,230 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 04:36:20,231 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 04:36:20,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:20,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:20,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 04:36:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,257 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 04:36:20,258 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 04:36:20,259 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 04:36:20,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:20,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:20,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:20,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:20,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:20,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:36:20,317 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:36:20,318 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:36:20,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:20,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:20,319 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 04:36:20,320 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 04:36:20,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:36:20,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:36:20,328 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:36:20,328 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0#1, v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2) = 8*ULTIMATE.start_entry_point_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2 Supporting invariants [] [2022-02-21 04:36:20,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:20,397 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:36:20,400 INFO L390 LassoCheck]: Loop: "assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset;" "entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1;" [2022-02-21 04:36:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:20,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:36:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:20,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:20,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {664#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {664#unseeded} is VALID [2022-02-21 04:36:20,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {664#unseeded} is VALID [2022-02-21 04:36:20,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#unseeded} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {664#unseeded} is VALID [2022-02-21 04:36:20,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#unseeded} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; {664#unseeded} is VALID [2022-02-21 04:36:20,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#unseeded} assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); {664#unseeded} is VALID [2022-02-21 04:36:20,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#unseeded} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {664#unseeded} is VALID [2022-02-21 04:36:20,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {664#unseeded} assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; {664#unseeded} is VALID [2022-02-21 04:36:20,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#unseeded} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {664#unseeded} is VALID [2022-02-21 04:36:20,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#unseeded} assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); {664#unseeded} is VALID [2022-02-21 04:36:20,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#unseeded} entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; {664#unseeded} is VALID [2022-02-21 04:36:20,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#unseeded} assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {664#unseeded} is VALID [2022-02-21 04:36:20,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#unseeded} assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; {664#unseeded} is VALID [2022-02-21 04:36:20,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#unseeded} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; {664#unseeded} is VALID [2022-02-21 04:36:20,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#unseeded} assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; {664#unseeded} is VALID [2022-02-21 04:36:20,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#unseeded} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {664#unseeded} is VALID [2022-02-21 04:36:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:20,500 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:36:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:20,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:20,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* 8 |ULTIMATE.start_entry_point_~j~0#1|)))} assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; {759#(and (<= 0 |ULTIMATE.start_entry_point_~j~0#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* |ULTIMATE.start_entry_point_~j~0#1| 8))) (<= 4 (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-21 04:36:20,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#(and (<= 0 |ULTIMATE.start_entry_point_~j~0#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* |ULTIMATE.start_entry_point_~j~0#1| 8))) (<= 4 (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; {712#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* 8 |ULTIMATE.start_entry_point_~j~0#1|)))) unseeded)} is VALID [2022-02-21 04:36:20,546 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 04:36:20,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:20,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:20,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:36:20,555 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:20,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 22 transitions. Complement of second has 4 states. [2022-02-21 04:36:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:36:20,579 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:20,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 04:36:20,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:20,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:20,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:20,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:20,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:20,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2022-02-21 04:36:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:20,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:20,580 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 04:36:20,581 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:36:20,581 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:20,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:20,581 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:36:20,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2022-02-21 04:36:20,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2022-02-21 04:36:20,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:20,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:36:20,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:36:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:36:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:36:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:36:20,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:20,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:20,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,586 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 04:36:20,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:20,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:36:20,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:36:20,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:20,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2022-02-21 04:36:20,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:20,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 04:36:20,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:36:20,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:36:20,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:36:20,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:20,589 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:20,589 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:20,589 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:20,589 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:36:20,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:36:20,589 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:20,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:20,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:36:20 BoogieIcfgContainer [2022-02-21 04:36:20,595 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:36:20,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:36:20,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:36:20,595 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:36:20,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:13" (3/4) ... [2022-02-21 04:36:20,598 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:36:20,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:36:20,599 INFO L158 Benchmark]: Toolchain (without parser) took 8486.69ms. Allocated memory was 111.1MB in the beginning and 138.4MB in the end (delta: 27.3MB). Free memory was 76.5MB in the beginning and 65.7MB in the end (delta: 10.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,599 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:36:20,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.22ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.42ms. Allocated memory is still 111.1MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,600 INFO L158 Benchmark]: Boogie Preprocessor took 42.61ms. Allocated memory is still 111.1MB. Free memory was 69.6MB in the beginning and 68.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,600 INFO L158 Benchmark]: RCFGBuilder took 373.13ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 54.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,600 INFO L158 Benchmark]: BuchiAutomizer took 7451.35ms. Allocated memory was 111.1MB in the beginning and 138.4MB in the end (delta: 27.3MB). Free memory was 54.9MB in the beginning and 65.7MB in the end (delta: -10.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-21 04:36:20,601 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 138.4MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:36:20,602 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.22ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.42ms. Allocated memory is still 111.1MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.61ms. Allocated memory is still 111.1MB. Free memory was 69.6MB in the beginning and 68.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.13ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 54.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7451.35ms. Allocated memory was 111.1MB in the beginning and 138.4MB in the end (delta: 27.3MB). Free memory was 54.9MB in the beginning and 65.7MB in the end (delta: -10.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 138.4MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + 8 * j and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 89 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax112 hnf100 lsp83 ukn61 mio100 lsp53 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf107 smp93 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 5 VariablesLoop: 0 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:36:20,635 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 04:36:20,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE