./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.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.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 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:36:09,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:36:09,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:36:09,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:36:09,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:36:09,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:36:09,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:36:09,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:36:09,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:36:09,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:36:09,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:36:09,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:36:09,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:36:09,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:36:09,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:36:09,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:36:09,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:36:09,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:36:09,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:36:09,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:36:09,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:36:09,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:36:09,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:36:09,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:36:09,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:36:09,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:36:09,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:36:09,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:36:09,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:36:09,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:36:09,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:36:09,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:36:09,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:36:09,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:36:09,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:36:09,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:36:09,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:36:09,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:36:09,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:36:09,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:36:09,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:36:09,246 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:09,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:36:09,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:36:09,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:36:09,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:36:09,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:36:09,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:36:09,263 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:36:09,264 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:36:09,264 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:36:09,264 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:36:09,264 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:36:09,264 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:36:09,264 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:36:09,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:36:09,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:36:09,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:36:09,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:36:09,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:36:09,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:36:09,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:36:09,268 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:36:09,268 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 -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2022-02-21 04:36:09,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:36:09,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:36:09,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:36:09,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:36:09,479 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:36:09,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2022-02-21 04:36:09,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deaa489b/ee5b8d986ddd487ea4c4dcaf3ac4c406/FLAGd25e71502 [2022-02-21 04:36:09,989 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:36:09,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2022-02-21 04:36:10,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deaa489b/ee5b8d986ddd487ea4c4dcaf3ac4c406/FLAGd25e71502 [2022-02-21 04:36:10,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deaa489b/ee5b8d986ddd487ea4c4dcaf3ac4c406 [2022-02-21 04:36:10,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:36:10,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:36:10,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:10,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:36:10,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:36:10,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:10" (1/1) ... [2022-02-21 04:36:10,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234d3cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:10, skipping insertion in model container [2022-02-21 04:36:10,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:10" (1/1) ... [2022-02-21 04:36:10,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:36:10,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:36:10,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:10,383 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:36:10,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:10,464 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:36:10,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:10 WrapperNode [2022-02-21 04:36:10,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:10,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:10,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:36:10,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:36:10,472 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:10" (1/1) ... [2022-02-21 04:36:10,506 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:10" (1/1) ... [2022-02-21 04:36:10,524 INFO L137 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 65 [2022-02-21 04:36:10,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:10,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:36:10,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:36:10,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:36:10,532 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:10" (1/1) ... [2022-02-21 04:36:10,532 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:10" (1/1) ... [2022-02-21 04:36:10,534 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:10" (1/1) ... [2022-02-21 04:36:10,534 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:10" (1/1) ... [2022-02-21 04:36:10,543 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:10" (1/1) ... [2022-02-21 04:36:10,548 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:10" (1/1) ... [2022-02-21 04:36:10,549 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:10" (1/1) ... [2022-02-21 04:36:10,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:36:10,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:36:10,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:36:10,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:36:10,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:10" (1/1) ... [2022-02-21 04:36:10,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,588 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:10,606 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:10,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 04:36:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:36:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 04:36:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 04:36:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:36:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-21 04:36:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:36:10,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:36:10,740 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:36:10,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:36:10,891 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:36:10,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:36:10,896 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:36:10,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:10 BoogieIcfgContainer [2022-02-21 04:36:10,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:36:10,898 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:36:10,898 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:36:10,901 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:36:10,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:10,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:36:10" (1/3) ... [2022-02-21 04:36:10,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9dac0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:10, skipping insertion in model container [2022-02-21 04:36:10,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:10,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:10" (2/3) ... [2022-02-21 04:36:10,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9dac0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:10, skipping insertion in model container [2022-02-21 04:36:10,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:10,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:10" (3/3) ... [2022-02-21 04:36:10,906 INFO L388 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2022-02-21 04:36:10,950 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:36:10,950 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:36:10,950 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:36:10,950 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:36:10,950 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:36:10,950 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:36:10,951 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:36:10,951 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:36:10,975 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:10,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:10,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:10,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:10,999 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:10,999 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,000 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:36:11,001 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:11,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:11,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,010 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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 15#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; 9#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; 6#L763true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 12#L767-3true [2022-02-21 04:36:11,011 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; 17#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; 18#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); 14#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:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2022-02-21 04:36:11,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458799142] [2022-02-21 04:36:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,205 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:11,206 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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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:11,208 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:11,208 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; {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:11,209 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;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; {23#false} is VALID [2022-02-21 04:36:11,210 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:11,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:11,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458799142] [2022-02-21 04:36:11,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458799142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:11,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:11,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:36:11,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750039646] [2022-02-21 04:36:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:11,219 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2022-02-21 04:36:11,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166915209] [2022-02-21 04:36:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,311 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:11,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:11,642 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:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:11,775 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 04:36:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:36:11,776 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:11,781 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:11,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-02-21 04:36:11,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 04:36:11,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 20 states and 25 transitions. [2022-02-21 04:36:11,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:11,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:11,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-02-21 04:36:11,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:11,805 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 04:36:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-02-21 04:36:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2022-02-21 04:36:11,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:11,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:11,819 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:11,820 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:11,822 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 04:36:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 04:36:11,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:11,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:11,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 25 transitions. [2022-02-21 04:36:11,823 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 25 transitions. [2022-02-21 04:36:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:11,824 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 04:36:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 04:36:11,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:11,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:11,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:11,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 04:36:11,826 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:36:11,826 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:36:11,826 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:36:11,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:36:11,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:36:11,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,827 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,828 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,828 INFO L791 eck$LassoCheckResult]: Stem: 72#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); 73#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 74#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 75#L767-3 [2022-02-21 04:36:11,828 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:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-02-21 04:36:11,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471564967] [2022-02-21 04:36:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,845 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2022-02-21 04:36:11,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620891240] [2022-02-21 04:36:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,874 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2022-02-21 04:36:11,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024615888] [2022-02-21 04:36:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,917 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:12,467 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:36:12,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:36:12,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:36:12,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:36:12,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:36:12,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:12,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:36:12,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:36:12,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration2_Lasso [2022-02-21 04:36:12,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:36:12,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:36:12,481 INFO L141 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:12,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,488 INFO L141 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:12,491 INFO L141 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:12,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,803 INFO L141 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:12,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,810 INFO L141 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:12,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:12,814 INFO L141 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:12,816 INFO L141 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:12,826 INFO L141 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:12,828 INFO L141 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:12,830 INFO L141 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:12,832 INFO L141 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:12,833 INFO L141 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:12,835 INFO L141 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:12,837 INFO L141 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:13,292 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:36:13,295 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:36:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,298 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:13,304 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:13,304 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:13,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:13,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:13,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:13,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,348 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:13,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,349 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:13,354 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:13,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:13,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,362 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:13,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:13,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:13,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,399 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:13,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,401 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:13,402 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:13,416 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:13,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,458 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:13,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,459 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:13,460 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:13,461 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:13,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,504 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:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,508 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:13,514 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:13,515 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:13,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:13,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:13,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:13,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,548 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:13,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,549 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:13,554 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:13,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,566 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:13,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,593 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:13,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,595 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:13,596 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:13,597 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:13,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:13,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:13,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:13,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,622 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:13,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,623 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:13,624 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:13,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:13,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,675 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:13,676 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:13,677 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:13,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:13,726 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:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,728 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:13,729 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:13,730 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:13,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:13,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:13,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:13,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:13,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:13,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:13,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:36:13,807 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:36:13,807 INFO L444 ModelExtractionUtils]: 18 out of 40 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 04:36:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:13,810 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:13,811 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:13,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:36:13,844 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:36:13,845 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:36:13,845 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:13,877 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:13,897 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:36:13,901 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:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:36:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:13,967 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:13,967 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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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:13,968 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:13,968 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; {132#unseeded} is VALID [2022-02-21 04:36:13,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#unseeded} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:13,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:14,052 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:14,053 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:14,054 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:14,055 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:14,055 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:14,055 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:14,057 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:14,065 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:14,066 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:14,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,068 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:14,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 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:14,139 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. 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 27 states and 36 transitions. Complement of second has 6 states. [2022-02-21 04:36:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:36:14,139 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:14,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 04:36:14,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,140 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:14,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-02-21 04:36:14,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:36:14,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,150 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 04:36:14,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:36:14,152 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:14,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,156 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:36:14,157 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 36 transitions. cyclomatic complexity: 14 [2022-02-21 04:36:14,158 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:36:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,158 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:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,159 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:14,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,160 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 2 letters. [2022-02-21 04:36:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:36:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,160 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 27 letters. Loop has 27 letters. [2022-02-21 04:36:14,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 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:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 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 4 letters. Loop has 4 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,162 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 2 letters. [2022-02-21 04:36:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:36:14,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 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 2 letters. [2022-02-21 04:36:14,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:36:14,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:14,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,163 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:14,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:14,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:14,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,165 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:14,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,166 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:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,167 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:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2022-02-21 04:36:14,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 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:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 5 letters. [2022-02-21 04:36:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 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:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:14,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:14,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,169 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:14,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:14,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:14,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,170 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:14,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:14,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,171 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 2 letters. [2022-02-21 04:36:14,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:14,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:36:14,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,173 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 2 letters. [2022-02-21 04:36:14,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:36:14,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,173 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:14,174 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:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 04:36:14,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:14,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:14,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2022-02-21 04:36:14,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:14,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. cyclomatic complexity: 14 [2022-02-21 04:36:14,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:36:14,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2022-02-21 04:36:14,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:36:14,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:36:14,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 04:36:14,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:14,184 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:36:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 04:36:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-02-21 04:36:14,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:14,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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,185 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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,186 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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,186 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,188 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:36:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:36:14,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 26 transitions. [2022-02-21 04:36:14,189 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 26 transitions. [2022-02-21 04:36:14,190 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,191 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:36:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:36:14,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:14,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-21 04:36:14,192 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 04:36:14,193 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 04:36:14,193 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:36:14,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-02-21 04:36:14,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,193 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:14,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:14,194 INFO L791 eck$LassoCheckResult]: Stem: 243#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); 244#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 249#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; 248#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; 245#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 246#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 247#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 241#L773-3 [2022-02-21 04:36:14,194 INFO L793 eck$LassoCheckResult]: Loop: 241#L773-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; 242#L773-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; 241#L773-3 [2022-02-21 04:36:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2022-02-21 04:36:14,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972581483] [2022-02-21 04:36:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#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); {350#true} is VALID [2022-02-21 04:36:14,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {352#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(<= 10 |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; {352#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {352#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} 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; {352#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {352#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {353#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} assume !(entry_point_~i~0#1 < entry_point_~len~0#1); {351#false} is VALID [2022-02-21 04:36:14,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {351#false} is VALID [2022-02-21 04:36:14,242 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:14,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:14,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972581483] [2022-02-21 04:36:14,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972581483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:14,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:14,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:14,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784317491] [2022-02-21 04:36:14,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:14,243 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2022-02-21 04:36:14,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890444571] [2022-02-21 04:36:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,250 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:14,286 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,325 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 04:36:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:36:14,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:14,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-02-21 04:36:14,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:36:14,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2022-02-21 04:36:14,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 04:36:14,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 04:36:14,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2022-02-21 04:36:14,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:14,333 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-21 04:36:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2022-02-21 04:36:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2022-02-21 04:36:14,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:14,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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,334 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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,334 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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,334 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,335 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 04:36:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-21 04:36:14,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 27 states and 34 transitions. [2022-02-21 04:36:14,335 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 27 states and 34 transitions. [2022-02-21 04:36:14,336 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,336 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 04:36:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-21 04:36:14,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:14,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-02-21 04:36:14,337 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 04:36:14,337 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 04:36:14,337 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:36:14,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:36:14,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,338 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:14,338 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:14,338 INFO L791 eck$LassoCheckResult]: Stem: 383#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); 384#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 391#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; 390#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; 387#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 388#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; 393#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; 398#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; 396#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 389#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 385#L773-3 [2022-02-21 04:36:14,338 INFO L793 eck$LassoCheckResult]: Loop: 385#L773-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; 386#L773-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; 385#L773-3 [2022-02-21 04:36:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2022-02-21 04:36:14,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343529778] [2022-02-21 04:36:14,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,358 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2022-02-21 04:36:14,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092044297] [2022-02-21 04:36:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,365 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2022-02-21 04:36:14,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812364404] [2022-02-21 04:36:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#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); {512#true} is VALID [2022-02-21 04:36:14,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {512#true} is VALID [2022-02-21 04:36:14,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#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; {512#true} is VALID [2022-02-21 04:36:14,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#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; {512#true} is VALID [2022-02-21 04:36:14,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:14,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#(= |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; {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:14,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= |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; {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:14,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(= |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; {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:14,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} is VALID [2022-02-21 04:36:14,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(= |ULTIMATE.start_entry_point_~i~0#1| 0)} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {515#(<= (+ |ULTIMATE.start_entry_point_~j~0#1| 1) 0)} is VALID [2022-02-21 04:36:14,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {515#(<= (+ |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; {513#false} is VALID [2022-02-21 04:36:14,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#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; {513#false} is VALID [2022-02-21 04:36:14,391 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:14,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:14,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812364404] [2022-02-21 04:36:14,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812364404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:14,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:14,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:14,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058449002] [2022-02-21 04:36:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:14,426 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:14,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:14,461 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 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:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,504 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-21 04:36:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:36:14,504 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:14,513 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:14,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2022-02-21 04:36:14,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2022-02-21 04:36:14,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:36:14,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:36:14,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-02-21 04:36:14,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:14,516 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:36:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-02-21 04:36:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-02-21 04:36:14,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:14,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 26 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:14,516 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 26 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:14,517 INFO L87 Difference]: Start difference. First operand 21 states and 26 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:14,517 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,518 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 04:36:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:36:14,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,518 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 21 states and 26 transitions. [2022-02-21 04:36:14,518 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 21 states and 26 transitions. [2022-02-21 04:36:14,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,519 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 04:36:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:36:14,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:14,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:14,519 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:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 04:36:14,520 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:36:14,520 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:36:14,520 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:36:14,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:36:14,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:14,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:14,521 INFO L791 eck$LassoCheckResult]: Stem: 544#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); 545#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 552#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; 551#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; 548#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 549#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; 553#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; 560#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; 558#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); 556#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; 554#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 550#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 546#L773-3 [2022-02-21 04:36:14,521 INFO L793 eck$LassoCheckResult]: Loop: 546#L773-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; 547#L773-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; 546#L773-3 [2022-02-21 04:36:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2022-02-21 04:36:14,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735004822] [2022-02-21 04:36:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#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); {669#true} is VALID [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {669#true} is VALID [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#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; {669#true} is VALID [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#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; {669#true} is VALID [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {669#true} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {669#true} is VALID [2022-02-21 04:36:14,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#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; {669#true} is VALID [2022-02-21 04:36:14,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#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; {671#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} is VALID [2022-02-21 04:36:14,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(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; {672#(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:14,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {672#(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); {670#false} is VALID [2022-02-21 04:36:14,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#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; {670#false} is VALID [2022-02-21 04:36:14,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#false} assume !(entry_point_~i~0#1 < entry_point_~len~0#1); {670#false} is VALID [2022-02-21 04:36:14,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {670#false} is VALID [2022-02-21 04:36:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:14,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:14,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735004822] [2022-02-21 04:36:14,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735004822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:14,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:14,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:14,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255520758] [2022-02-21 04:36:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:14,564 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2022-02-21 04:36:14,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696687363] [2022-02-21 04:36:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,571 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:14,599 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:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:14,651 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 04:36:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:36:14,651 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:14,661 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:14,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2022-02-21 04:36:14,662 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:36:14,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2022-02-21 04:36:14,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:14,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:14,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2022-02-21 04:36:14,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:14,663 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-21 04:36:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2022-02-21 04:36:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-02-21 04:36:14,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:14,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 28 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:14,664 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 28 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:14,664 INFO L87 Difference]: Start difference. First operand 25 states and 28 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:14,664 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,665 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-21 04:36:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-21 04:36:14,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,665 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 25 states and 28 transitions. [2022-02-21 04:36:14,665 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 25 states and 28 transitions. [2022-02-21 04:36:14,665 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:14,666 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-21 04:36:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-21 04:36:14,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:14,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:14,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:14,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:14,667 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:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 04:36:14,667 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 04:36:14,667 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 04:36:14,667 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:36:14,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 04:36:14,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:14,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:14,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:14,668 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:14,668 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:14,668 INFO L791 eck$LassoCheckResult]: Stem: 704#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); 705#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 712#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; 711#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; 708#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 709#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; 713#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; 720#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; 718#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); 716#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; 714#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 710#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 706#L773-3 [2022-02-21 04:36:14,668 INFO L793 eck$LassoCheckResult]: Loop: 706#L773-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; 707#L773-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; 706#L773-3 [2022-02-21 04:36:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2022-02-21 04:36:14,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064286900] [2022-02-21 04:36:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#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); {852#true} is VALID [2022-02-21 04:36:14,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {854#(<= 10 |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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} 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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |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; {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} 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; {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |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; {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 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); {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_entry_point_~i~0#1| 0))} 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; {856#(<= (+ |ULTIMATE.start_entry_point_~i~0#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#(<= (+ |ULTIMATE.start_entry_point_~i~0#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~i~0#1 < entry_point_~len~0#1); {853#false} is VALID [2022-02-21 04:36:14,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {853#false} is VALID [2022-02-21 04:36:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:14,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:14,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064286900] [2022-02-21 04:36:14,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064286900] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:36:14,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911260905] [2022-02-21 04:36:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:36:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:14,718 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:36:14,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 04:36:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:14,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:14,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#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); {852#true} is VALID [2022-02-21 04:36:14,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {854#(<= 10 |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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} 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; {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {854#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |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; {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} 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; {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |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; {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 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); {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} is VALID [2022-02-21 04:36:14,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 0))} 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; {888#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 1))} is VALID [2022-02-21 04:36:14,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {888#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 1))} assume !(entry_point_~i~0#1 < entry_point_~len~0#1); {853#false} is VALID [2022-02-21 04:36:14,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {853#false} is VALID [2022-02-21 04:36:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:14,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:36:14,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#false} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {853#false} is VALID [2022-02-21 04:36:14,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(< |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); {853#false} is VALID [2022-02-21 04:36:14,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 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; {898#(< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 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); {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 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; {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 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; {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 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; {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {918#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {902#(< (+ |ULTIMATE.start_entry_point_~i~0#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {918#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} 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; {918#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {918#(< 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; {918#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {918#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:14,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#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); {852#true} is VALID [2022-02-21 04:36:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:14,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911260905] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:36:14,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:36:14,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-21 04:36:14,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814986326] [2022-02-21 04:36:14,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:36:14,941 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2022-02-21 04:36:14,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:14,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432756962] [2022-02-21 04:36:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:14,954 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:14,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 04:36:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-02-21 04:36:14,982 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:15,110 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-21 04:36:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:36:15,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:15,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:15,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. [2022-02-21 04:36:15,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-02-21 04:36:15,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 55 transitions. [2022-02-21 04:36:15,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 04:36:15,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 04:36:15,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2022-02-21 04:36:15,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:36:15,144 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-02-21 04:36:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2022-02-21 04:36:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-02-21 04:36:15,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:15,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 55 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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:15,148 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 55 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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:15,148 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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:15,148 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:15,151 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-21 04:36:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-21 04:36:15,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:15,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:15,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 47 states and 55 transitions. [2022-02-21 04:36:15,154 INFO L87 Difference]: Start difference. First operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 47 states and 55 transitions. [2022-02-21 04:36:15,155 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:36:15,158 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-21 04:36:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-21 04:36:15,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:15,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:15,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:15,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-21 04:36:15,163 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 04:36:15,163 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 04:36:15,163 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:36:15,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-02-21 04:36:15,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:15,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:15,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:15,164 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:15,164 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:15,164 INFO L791 eck$LassoCheckResult]: Stem: 983#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); 984#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; 989#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; 988#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; 985#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; 986#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; 992#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; 1012#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; 1011#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); 990#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; 991#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; 994#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; 998#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; 995#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 987#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 981#L773-3 [2022-02-21 04:36:15,165 INFO L793 eck$LassoCheckResult]: Loop: 981#L773-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; 982#L773-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; 981#L773-3 [2022-02-21 04:36:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:15,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2022-02-21 04:36:15,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:15,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524355887] [2022-02-21 04:36:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,222 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2022-02-21 04:36:15,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:15,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503543316] [2022-02-21 04:36:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,228 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2022-02-21 04:36:15,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:15,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499205559] [2022-02-21 04:36:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:15,248 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:15,888 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:36:15,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:36:15,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:36:15,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:36:15,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:36:15,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:15,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:36:15,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:36:15,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration7_Lasso [2022-02-21 04:36:15,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:36:15,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:36:15,890 INFO L141 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,892 INFO L141 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,894 INFO L141 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,910 INFO L141 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,913 INFO L141 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,915 INFO L141 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,109 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:36:16,110 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:36:16,115 INFO L141 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,117 INFO L141 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,120 INFO L141 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,122 INFO L141 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,123 INFO L141 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,127 INFO L141 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,129 INFO L141 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,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:16,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:16,135 INFO L141 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,137 INFO L141 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,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:16,140 INFO L141 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,144 INFO L141 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,148 INFO L141 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,150 INFO L141 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,627 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:36:16,627 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:36:16,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,628 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:16,629 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:16,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:16,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,666 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:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,667 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:16,668 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:16,720 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,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,755 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:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,757 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:16,757 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:16,759 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,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,798 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:16,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,812 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:16,813 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:16,814 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,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,854 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:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,856 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:16,857 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:16,858 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,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,900 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:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,902 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:16,903 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:16,905 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,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:16,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:16,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:16,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,929 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:16,930 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:16,931 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,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:16,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:36:16,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:16,970 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:16,971 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:16,972 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,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:16,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:16,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:16,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:16,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:16,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:16,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,004 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:17,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,006 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:17,020 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:17,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:17,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,048 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:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,050 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:17,057 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:17,058 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:17,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:17,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:17,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:17,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:36:17,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,081 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:17,081 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:17,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:17,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:17,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:17,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:17,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,115 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:17,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,117 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:17,118 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:17,119 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:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,157 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:17,157 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:17,159 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:17,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:36:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,191 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:17,191 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:17,193 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:17,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,230 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:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,232 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:17,234 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:17,234 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:17,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:17,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:17,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:17,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,271 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:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,272 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:17,273 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:17,275 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:17,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,280 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 04:36:17,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,285 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:36:17,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,306 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:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,308 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:17,308 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:17,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:36:17,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:17,353 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:17,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,354 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:17,355 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:17,357 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:17,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:17,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:17,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:17,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:17,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:17,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:17,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:36:17,398 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:36:17,399 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 04:36:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:17,400 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:17,401 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:17,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:36:17,408 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:36:17,408 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:36:17,408 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0#1, ULTIMATE.start_entry_point_~j~0#1) = 1*ULTIMATE.start_entry_point_~i~0#1 + 2*ULTIMATE.start_entry_point_~j~0#1 Supporting invariants [1*ULTIMATE.start_entry_point_~i~0#1 - 1 >= 0] [2022-02-21 04:36:17,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:36:17,460 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2022-02-21 04:36:17,469 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:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:17,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {1229#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); {1229#unseeded} is VALID [2022-02-21 04:36:17,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#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_~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, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;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; {1229#unseeded} is VALID [2022-02-21 04:36:17,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#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; {1229#unseeded} is VALID [2022-02-21 04:36:17,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {1229#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; {1229#unseeded} is VALID [2022-02-21 04:36:17,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {1229#unseeded} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;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; {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) unseeded)} is VALID [2022-02-21 04:36:17,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) 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; {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) unseeded)} is VALID [2022-02-21 04:36:17,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) 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; {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) unseeded)} is VALID [2022-02-21 04:36:17,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) 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; {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) unseeded)} is VALID [2022-02-21 04:36:17,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) 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); {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) unseeded)} is VALID [2022-02-21 04:36:17,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {1304#(and (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) 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; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) 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; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) 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; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) 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; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} entry_point_~j~0#1 := entry_point_~i~0#1 - 1; {1283#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) unseeded)} is VALID [2022-02-21 04:36:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:36:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:17,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:17,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1284#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) (>= oldRank0 (+ |ULTIMATE.start_entry_point_~i~0#1| (* 2 |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; {1335#(and (>= oldRank0 (+ |ULTIMATE.start_entry_point_~i~0#1| (* |ULTIMATE.start_entry_point_~j~0#1| 2))) (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) (<= 0 |ULTIMATE.start_entry_point_~j~0#1|))} is VALID [2022-02-21 04:36:17,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#(and (>= oldRank0 (+ |ULTIMATE.start_entry_point_~i~0#1| (* |ULTIMATE.start_entry_point_~j~0#1| 2))) (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) (<= 0 |ULTIMATE.start_entry_point_~j~0#1|))} 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; {1286#(and (>= (+ (- 1) |ULTIMATE.start_entry_point_~i~0#1|) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_entry_point_~i~0#1| (* 2 |ULTIMATE.start_entry_point_~j~0#1|)))) unseeded))} is VALID [2022-02-21 04:36:17,642 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,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:17,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:36:17,651 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 41 transitions. Complement of second has 6 states. [2022-02-21 04:36:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:36:17,707 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:17,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 04:36:17,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:17,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:17,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2022-02-21 04:36:17,709 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:17,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:17,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 04:36:17,710 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:36:17,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:17,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:36:17,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 41 transitions. cyclomatic complexity: 9 [2022-02-21 04:36:17,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. cyclomatic complexity: 9 [2022-02-21 04:36:17,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:17,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:36:17,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 34 letters. [2022-02-21 04:36:17,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 34 letters. [2022-02-21 04:36:17,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 34 letters. Loop has 34 letters. [2022-02-21 04:36:17,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:36:17,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:36:17,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:36:17,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:36:17,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:17,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:17,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:36:17,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:36:17,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,716 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 04:36:17,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:36:17,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:36:17,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:36:17,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:17,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. cyclomatic complexity: 9 [2022-02-21 04:36:17,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:17,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:36:17,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:36:17,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:17,719 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:36:17,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:36:17,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:36:17,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:36:17,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:36:17 BoogieIcfgContainer [2022-02-21 04:36:17,724 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:36:17,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:36:17,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:36:17,725 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:36:17,726 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:10" (3/4) ... [2022-02-21 04:36:17,727 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:36:17,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:36:17,728 INFO L158 Benchmark]: Toolchain (without parser) took 7698.40ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 71.4MB in the beginning and 64.5MB in the end (delta: 7.0MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,728 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.3MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:36:17,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.97ms. Allocated memory is still 92.3MB. Free memory was 71.2MB in the beginning and 52.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.03ms. Allocated memory is still 92.3MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,729 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 49.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,729 INFO L158 Benchmark]: RCFGBuilder took 345.66ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 48.7MB in the beginning and 92.1MB in the end (delta: -43.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,730 INFO L158 Benchmark]: BuchiAutomizer took 6826.75ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 92.1MB in the beginning and 64.5MB in the end (delta: 27.7MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2022-02-21 04:36:17,730 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 151.0MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:36:17,731 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.3MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.97ms. Allocated memory is still 92.3MB. Free memory was 71.2MB in the beginning and 52.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.03ms. Allocated memory is still 92.3MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 49.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.66ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 48.7MB in the beginning and 92.1MB in the end (delta: -43.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6826.75ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 92.1MB in the beginning and 64.5MB in the end (delta: 27.7MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 151.0MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function i + 2 * j and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 116 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax113 hnf100 lsp82 ukn60 mio100 lsp50 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf126 smp91 tf100 neg96 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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:17,761 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:17,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:18,169 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