./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:19:04,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:19:04,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:19:04,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:19:04,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:19:04,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:19:04,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:19:04,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:19:04,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:19:04,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:19:04,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:19:04,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:19:04,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:19:04,689 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:19:04,689 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:19:04,691 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:19:04,692 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:19:04,692 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:19:04,692 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:19:04,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:19:04,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:19:04,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:19:04,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:19:04,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:19:04,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:19:04,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:19:04,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:19:04,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:19:04,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:19:04,699 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:19:04,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:19:04,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:19:04,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:19:04,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:19:04,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:19:04,701 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:19:04,701 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 [2024-10-15 00:19:04,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:19:05,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:19:05,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:19:05,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:19:05,045 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:19:05,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2024-10-15 00:19:06,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:19:06,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:19:06,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2024-10-15 00:19:06,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95b381e9/5e40f56aaaad41b0b19d4551f83a6d3f/FLAGff5dac19f [2024-10-15 00:19:06,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95b381e9/5e40f56aaaad41b0b19d4551f83a6d3f [2024-10-15 00:19:06,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:19:06,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:19:06,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:06,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:19:06,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:19:06,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:06" (1/1) ... [2024-10-15 00:19:06,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a9bf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:06, skipping insertion in model container [2024-10-15 00:19:06,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:06" (1/1) ... [2024-10-15 00:19:06,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:19:07,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:07,129 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:19:07,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:07,194 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:19:07,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07 WrapperNode [2024-10-15 00:19:07,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:07,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:07,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:19:07,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:19:07,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,233 INFO L138 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-10-15 00:19:07,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:07,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:19:07,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:19:07,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:19:07,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,291 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-15 00:19:07,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:19:07,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:19:07,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:19:07,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:19:07,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (1/1) ... [2024-10-15 00:19:07,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:07,345 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) [2024-10-15 00:19:07,352 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 [2024-10-15 00:19:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:19:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:19:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-10-15 00:19:07,404 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-10-15 00:19:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 00:19:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:19:07,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:19:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:19:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:19:07,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:19:07,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:19:07,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:19:07,667 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-15 00:19:07,668 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:19:07,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:19:07,690 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:19:07,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:07 BoogieIcfgContainer [2024-10-15 00:19:07,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:19:07,692 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:19:07,694 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:19:07,698 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:19:07,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:07,699 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:19:06" (1/3) ... [2024-10-15 00:19:07,700 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46728d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:07, skipping insertion in model container [2024-10-15 00:19:07,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:07,700 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:07" (2/3) ... [2024-10-15 00:19:07,701 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46728d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:07, skipping insertion in model container [2024-10-15 00:19:07,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:07,701 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:07" (3/3) ... [2024-10-15 00:19:07,702 INFO L332 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2024-10-15 00:19:07,767 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:19:07,768 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:19:07,768 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:19:07,768 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:19:07,768 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:19:07,768 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:19:07,768 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:19:07,768 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:19:07,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:19:07,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:07,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:07,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:07,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:07,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:07,811 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:19:07,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:19:07,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:07,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:07,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:07,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:07,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:07,821 INFO L745 eck$LassoCheckResult]: Stem: 9#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 10#L23-3true [2024-10-15 00:19:07,822 INFO L747 eck$LassoCheckResult]: Loop: 10#L23-3true call main_#t~mem9#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 7#L23-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#0(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 5#L26true call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 11#$Ultimate##0true ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 8#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 14#recFINALtrue assume true; 12#recEXITtrue >#31#return; 3#L26-1true call write~int#1(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1; 10#L23-3true [2024-10-15 00:19:07,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2024-10-15 00:19:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429604183] [2024-10-15 00:19:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:07,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2024-10-15 00:19:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742502580] [2024-10-15 00:19:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742502580] [2024-10-15 00:19:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742502580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 00:19:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42975576] [2024-10-15 00:19:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:08,633 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:19:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 00:19:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-15 00:19:08,674 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:19:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:08,769 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-10-15 00:19:08,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-10-15 00:19:08,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:08,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-10-15 00:19:08,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:19:08,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:08,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-10-15 00:19:08,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:08,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:19:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-10-15 00:19:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:19:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 00:19:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-15 00:19:08,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:19:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 00:19:08,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 00:19:08,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:19:08,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-10-15 00:19:08,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:08,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:08,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:08,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:08,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:08,820 INFO L745 eck$LassoCheckResult]: Stem: 58#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 56#L23-3 [2024-10-15 00:19:08,820 INFO L747 eck$LassoCheckResult]: Loop: 56#L23-3 call main_#t~mem9#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 60#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#0(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 52#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 57#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 51#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 53#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 57#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 51#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 54#recFINAL assume true; 61#recEXIT >#29#return; 62#L17-1 #res := #t~ret6;havoc #t~ret6; 63#recFINAL assume true; 64#recEXIT >#31#return; 55#L26-1 call write~int#1(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1; 56#L23-3 [2024-10-15 00:19:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2024-10-15 00:19:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69776173] [2024-10-15 00:19:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:08,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:08,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2024-10-15 00:19:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184892141] [2024-10-15 00:19:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:19:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184892141] [2024-10-15 00:19:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184892141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:09,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870497744] [2024-10-15 00:19:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 00:19:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:09,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-15 00:19:09,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:09,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 00:19:09,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:19:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:10,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870497744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:10,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:10,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 24 [2024-10-15 00:19:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104648013] [2024-10-15 00:19:10,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:10,537 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:19:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 00:19:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-10-15 00:19:10,543 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 00:19:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:10,773 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-10-15 00:19:10,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-10-15 00:19:10,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:10,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2024-10-15 00:19:10,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-15 00:19:10,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-15 00:19:10,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2024-10-15 00:19:10,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:10,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-15 00:19:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2024-10-15 00:19:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-15 00:19:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 00:19:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-15 00:19:10,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-15 00:19:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:19:10,782 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-15 00:19:10,782 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:19:10,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2024-10-15 00:19:10,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:19:10,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:10,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:10,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:19:10,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:10,785 INFO L745 eck$LassoCheckResult]: Stem: 217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 215#L23-3 [2024-10-15 00:19:10,785 INFO L747 eck$LassoCheckResult]: Loop: 215#L23-3 call main_#t~mem9#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 219#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#0(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 211#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 216#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 210#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 212#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 216#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 210#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 212#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 216#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 210#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 213#recFINAL assume true; 220#recEXIT >#29#return; 221#L17-1 #res := #t~ret6;havoc #t~ret6; 222#recFINAL assume true; 226#recEXIT >#29#return; 224#L17-1 #res := #t~ret6;havoc #t~ret6; 225#recFINAL assume true; 223#recEXIT >#31#return; 214#L26-1 call write~int#1(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1; 215#L23-3 [2024-10-15 00:19:10,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2024-10-15 00:19:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795410910] [2024-10-15 00:19:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:10,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:10,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2024-10-15 00:19:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102598368] [2024-10-15 00:19:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:19:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 00:19:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102598368] [2024-10-15 00:19:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102598368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576132683] [2024-10-15 00:19:11,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:19:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:11,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:11,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:11,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 00:19:11,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:19:11,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:11,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-15 00:19:11,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:11,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 00:19:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 00:19:11,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-15 00:19:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:48,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576132683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:50,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 00:19:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2024-10-15 00:19:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278033061] [2024-10-15 00:19:50,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:50,690 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:19:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 00:19:50,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=442, Unknown=3, NotChecked=0, Total=506 [2024-10-15 00:19:50,693 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:20:17,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 00:20:18,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 00:20:32,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 00:20:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:20:33,014 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-15 00:20:33,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2024-10-15 00:20:33,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:20:33,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2024-10-15 00:20:33,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-15 00:20:33,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:20:33,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-10-15 00:20:33,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:20:33,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-15 00:20:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-10-15 00:20:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-15 00:20:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 00:20:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-15 00:20:33,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-15 00:20:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:20:33,027 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-15 00:20:33,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:20:33,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-10-15 00:20:33,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:20:33,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:20:33,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:20:33,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:20:33,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-15 00:20:33,031 INFO L745 eck$LassoCheckResult]: Stem: 385#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 383#L23-3 [2024-10-15 00:20:33,032 INFO L747 eck$LassoCheckResult]: Loop: 383#L23-3 call main_#t~mem9#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 387#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#0(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 379#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 384#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 378#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 380#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 384#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 378#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 380#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 384#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 378#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#0(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 380#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 384#$Ultimate##0 ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4); 378#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 381#recFINAL assume true; 388#recEXIT >#29#return; 389#L17-1 #res := #t~ret6;havoc #t~ret6; 390#recFINAL assume true; 397#recEXIT >#29#return; 396#L17-1 #res := #t~ret6;havoc #t~ret6; 395#recFINAL assume true; 394#recEXIT >#29#return; 392#L17-1 #res := #t~ret6;havoc #t~ret6; 393#recFINAL assume true; 391#recEXIT >#31#return; 382#L26-1 call write~int#1(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1; 383#L23-3 [2024-10-15 00:20:33,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:20:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2024-10-15 00:20:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:20:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945030237] [2024-10-15 00:20:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:20:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:20:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:20:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:20:33,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:20:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2024-10-15 00:20:33,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:20:33,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373441253] [2024-10-15 00:20:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:20:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:20:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:20:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:20:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:20:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2024-10-15 00:20:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:20:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381802654] [2024-10-15 00:20:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:20:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:20:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:20:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:20:33,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace