./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-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(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:48:33,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:48:33,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:48:33,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:48:33,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:48:33,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:48:33,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:48:33,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:48:33,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:48:33,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:48:33,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:48:33,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:48:33,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:48:33,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:48:33,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:48:33,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:48:33,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:48:33,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:48:33,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:48:33,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:48:33,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:48:33,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:48:33,395 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:48:33,395 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:48:33,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:48:33,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:48:33,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:48:33,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:48:33,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:48:33,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:48:33,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:48:33,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:48:33,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:48:33,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:48:33,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:48:33,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:48:33,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:33,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:48:33,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:48:33,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:48:33,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:48:33,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:48:33,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:48:33,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:48:33,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:48:33,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G valid-memcleanup) ) 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 -> 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 [2024-11-10 14:48:33,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:48:33,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:48:33,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:48:33,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:48:33,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:48:33,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-11-10 14:48:35,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:48:35,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:48:35,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-11-10 14:48:35,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a5cc8b9/d4464a4a6606496f8d95aad10296d5d6/FLAG6ceac3e67 [2024-11-10 14:48:35,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a5cc8b9/d4464a4a6606496f8d95aad10296d5d6 [2024-11-10 14:48:35,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:48:35,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:48:35,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:35,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:48:35,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:48:35,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:35" (1/1) ... [2024-11-10 14:48:35,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e286df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:35, skipping insertion in model container [2024-11-10 14:48:35,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:35" (1/1) ... [2024-11-10 14:48:35,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:48:36,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:36,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:48:36,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:36,214 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:48:36,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36 WrapperNode [2024-11-10 14:48:36,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:36,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:36,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:48:36,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:48:36,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,260 INFO L138 Inliner]: procedures = 129, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2024-11-10 14:48:36,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:36,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:48:36,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:48:36,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:48:36,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,301 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 3, 1]. [2024-11-10 14:48:36,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:48:36,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:48:36,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:48:36,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:48:36,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (1/1) ... [2024-11-10 14:48:36,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:36,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:36,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:48:36,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 14:48:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2024-11-10 14:48:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:48:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:48:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:48:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 14:48:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 14:48:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 14:48:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 14:48:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 14:48:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:48:36,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:48:36,511 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:48:36,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:48:36,532 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 14:48:36,718 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 14:48:36,746 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-10 14:48:36,747 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:48:36,764 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:48:36,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:48:36,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:36 BoogieIcfgContainer [2024-11-10 14:48:36,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:48:36,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:48:36,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:48:36,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:48:36,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:48:35" (1/3) ... [2024-11-10 14:48:36,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c810750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:36, skipping insertion in model container [2024-11-10 14:48:36,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:36" (2/3) ... [2024-11-10 14:48:36,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c810750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:36, skipping insertion in model container [2024-11-10 14:48:36,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:36" (3/3) ... [2024-11-10 14:48:36,774 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2024-11-10 14:48:36,787 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:48:36,787 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:48:36,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:48:36,834 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34639fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:48:36,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:48:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 14:48:36,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:36,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:36,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash 805010716, now seen corresponding path program 1 times [2024-11-10 14:48:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130719205] [2024-11-10 14:48:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 14:48:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 14:48:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130719205] [2024-11-10 14:48:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130719205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:48:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692910478] [2024-11-10 14:48:37,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:37,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:48:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:48:37,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:37,114 INFO L87 Difference]: Start difference. First operand has 55 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:37,135 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-10 14:48:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:48:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-10 14:48:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:37,143 INFO L225 Difference]: With dead ends: 54 [2024-11-10 14:48:37,143 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 14:48:37,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:37,149 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:37,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 14:48:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 14:48:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 42 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-10 14:48:37,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 28 [2024-11-10 14:48:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:37,191 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-10 14:48:37,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-10 14:48:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 14:48:37,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:37,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:37,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:48:37,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:37,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash -675765231, now seen corresponding path program 1 times [2024-11-10 14:48:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261522101] [2024-11-10 14:48:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 14:48:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261522101] [2024-11-10 14:48:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261522101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347458046] [2024-11-10 14:48:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:37,702 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-11-10 14:48:37,704 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-11-10 14:48:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:37,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:48:37,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:37,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347458046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:48:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-10 14:48:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449278741] [2024-11-10 14:48:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:48:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:48:37,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:48:37,967 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:38,040 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-11-10 14:48:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:48:38,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-10 14:48:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:38,045 INFO L225 Difference]: With dead ends: 49 [2024-11-10 14:48:38,045 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 14:48:38,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:48:38,047 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:38,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 272 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 14:48:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 14:48:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-10 14:48:38,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 36 [2024-11-10 14:48:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:38,061 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-10 14:48:38,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-10 14:48:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 14:48:38,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:38,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:38,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:48:38,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:38,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1828802613, now seen corresponding path program 1 times [2024-11-10 14:48:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152028107] [2024-11-10 14:48:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 14:48:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152028107] [2024-11-10 14:48:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152028107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895009912] [2024-11-10 14:48:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:38,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:38,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:38,517 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-11-10 14:48:38,519 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-11-10 14:48:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:38,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 14:48:38,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:38,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:48:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895009912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:48:38,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:48:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 14:48:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387002272] [2024-11-10 14:48:38,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:48:38,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 14:48:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 14:48:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-10 14:48:38,940 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 14:48:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:39,180 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-11-10 14:48:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 14:48:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-10 14:48:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:39,183 INFO L225 Difference]: With dead ends: 74 [2024-11-10 14:48:39,183 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 14:48:39,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-10 14:48:39,184 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 25 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:39,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 468 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 14:48:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2024-11-10 14:48:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-11-10 14:48:39,191 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 40 [2024-11-10 14:48:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:39,191 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-11-10 14:48:39,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 14:48:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-11-10 14:48:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 14:48:39,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:39,192 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:39,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:48:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 14:48:39,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1743828391, now seen corresponding path program 2 times [2024-11-10 14:48:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103283568] [2024-11-10 14:48:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 14:48:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103283568] [2024-11-10 14:48:39,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103283568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:48:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845636210] [2024-11-10 14:48:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:48:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:48:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:39,515 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-11-10 14:48:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:39,596 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2024-11-10 14:48:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 14:48:39,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) Word has length 44 [2024-11-10 14:48:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:39,598 INFO L225 Difference]: With dead ends: 77 [2024-11-10 14:48:39,598 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 14:48:39,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 14:48:39,599 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:39,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 14:48:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-11-10 14:48:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 14:48:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-11-10 14:48:39,609 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 44 [2024-11-10 14:48:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:39,610 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-11-10 14:48:39,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-11-10 14:48:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-11-10 14:48:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 14:48:39,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:39,612 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:39,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:48:39,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -566179208, now seen corresponding path program 1 times [2024-11-10 14:48:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373701] [2024-11-10 14:48:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 14:48:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911373701] [2024-11-10 14:48:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911373701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:48:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179981582] [2024-11-10 14:48:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:48:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:48:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:39,801 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 14:48:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:39,893 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2024-11-10 14:48:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:48:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-10 14:48:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:39,895 INFO L225 Difference]: With dead ends: 97 [2024-11-10 14:48:39,895 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 14:48:39,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 14:48:39,897 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:39,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 14:48:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2024-11-10 14:48:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 14:48:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-11-10 14:48:39,910 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 46 [2024-11-10 14:48:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:39,911 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-11-10 14:48:39,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 14:48:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-11-10 14:48:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 14:48:39,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:39,912 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:39,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:48:39,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:39,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash -859582215, now seen corresponding path program 1 times [2024-11-10 14:48:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:39,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951465120] [2024-11-10 14:48:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:48:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951465120] [2024-11-10 14:48:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951465120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242748255] [2024-11-10 14:48:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:40,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:40,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:48:40,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:48:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:40,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 14:48:40,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:40,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-10 14:48:40,530 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 20 treesize of output 12 [2024-11-10 14:48:40,558 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 16 treesize of output 8 [2024-11-10 14:48:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:40,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:48:40,591 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 25 treesize of output 17 [2024-11-10 14:48:40,593 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 21 treesize of output 13 [2024-11-10 14:48:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:48:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242748255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:48:40,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:48:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 15 [2024-11-10 14:48:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293335142] [2024-11-10 14:48:40,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:48:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 14:48:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 14:48:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 14:48:40,617 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:40,847 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2024-11-10 14:48:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:48:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2024-11-10 14:48:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:40,848 INFO L225 Difference]: With dead ends: 125 [2024-11-10 14:48:40,848 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 14:48:40,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-10 14:48:40,849 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 79 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:40,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 559 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:48:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 14:48:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2024-11-10 14:48:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 86 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-10 14:48:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2024-11-10 14:48:40,860 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 46 [2024-11-10 14:48:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2024-11-10 14:48:40,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:48:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2024-11-10 14:48:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 14:48:40,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:40,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:40,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:48:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:41,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1209128680, now seen corresponding path program 2 times [2024-11-10 14:48:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092316970] [2024-11-10 14:48:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 14:48:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092316970] [2024-11-10 14:48:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092316970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86215748] [2024-11-10 14:48:41,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:48:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:41,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:41,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:48:41,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 14:48:41,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:48:41,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:48:41,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 14:48:41,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 14:48:41,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:48:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 14:48:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86215748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:48:41,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:48:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 26 [2024-11-10 14:48:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583942000] [2024-11-10 14:48:41,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:48:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:48:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:41,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:48:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:48:41,900 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 14:48:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:42,181 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2024-11-10 14:48:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 14:48:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-10 14:48:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:42,183 INFO L225 Difference]: With dead ends: 186 [2024-11-10 14:48:42,184 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 14:48:42,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-11-10 14:48:42,187 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:42,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 798 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:48:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 14:48:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2024-11-10 14:48:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 14:48:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2024-11-10 14:48:42,204 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 48 [2024-11-10 14:48:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2024-11-10 14:48:42,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 14:48:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2024-11-10 14:48:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 14:48:42,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:42,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:42,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:48:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:42,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2027353020, now seen corresponding path program 1 times [2024-11-10 14:48:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388522685] [2024-11-10 14:48:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:42,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:42,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 14:48:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388522685] [2024-11-10 14:48:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388522685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:42,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:48:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310677292] [2024-11-10 14:48:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:48:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:48:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:42,520 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-11-10 14:48:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:42,574 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2024-11-10 14:48:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 14:48:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 50 [2024-11-10 14:48:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:42,577 INFO L225 Difference]: With dead ends: 139 [2024-11-10 14:48:42,577 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 14:48:42,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:48:42,578 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:42,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 277 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 14:48:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2024-11-10 14:48:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 125 states have internal predecessors, (149), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 14:48:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2024-11-10 14:48:42,590 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 50 [2024-11-10 14:48:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2024-11-10 14:48:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-11-10 14:48:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2024-11-10 14:48:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 14:48:42,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:42,591 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:42,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:48:42,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:42,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2115832457, now seen corresponding path program 3 times [2024-11-10 14:48:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:42,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221982229] [2024-11-10 14:48:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:48:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:48:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:48:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221982229] [2024-11-10 14:48:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221982229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49285316] [2024-11-10 14:48:43,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:48:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:43,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:48:43,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 14:48:43,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 14:48:43,233 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:48:43,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 14:48:43,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:43,256 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 6 treesize of output 5 [2024-11-10 14:48:43,292 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 11 treesize of output 7 [2024-11-10 14:48:43,297 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 11 treesize of output 7 [2024-11-10 14:48:43,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:48:43,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 14:48:43,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 14:48:43,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 14:48:43,792 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 65 treesize of output 41 [2024-11-10 14:48:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:43,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:48:43,981 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 72 treesize of output 52 [2024-11-10 14:48:43,984 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 56 treesize of output 36 [2024-11-10 14:49:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:49:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49285316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:49:00,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:49:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 24 [2024-11-10 14:49:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382532378] [2024-11-10 14:49:00,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:49:00,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 14:49:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:49:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 14:49:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=486, Unknown=4, NotChecked=0, Total=552 [2024-11-10 14:49:00,486 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:49:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:49:01,107 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2024-11-10 14:49:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:49:01,108 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-11-10 14:49:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:49:01,109 INFO L225 Difference]: With dead ends: 217 [2024-11-10 14:49:01,109 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 14:49:01,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=90, Invalid=662, Unknown=4, NotChecked=0, Total=756 [2024-11-10 14:49:01,112 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 14:49:01,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 908 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 14:49:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 14:49:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2024-11-10 14:49:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.197674418604651) internal successors, (206), 175 states have internal predecessors, (206), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 14:49:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 233 transitions. [2024-11-10 14:49:01,128 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 233 transitions. Word has length 50 [2024-11-10 14:49:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:49:01,128 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 233 transitions. [2024-11-10 14:49:01,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:49:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 233 transitions. [2024-11-10 14:49:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 14:49:01,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:49:01,130 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:01,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 14:49:01,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:49:01,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:49:01,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:49:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1488412611, now seen corresponding path program 1 times [2024-11-10 14:49:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:49:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438182111] [2024-11-10 14:49:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:49:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 14:49:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 14:49:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 14:49:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:49:01,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438182111] [2024-11-10 14:49:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438182111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:49:01,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178117056] [2024-11-10 14:49:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:01,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:49:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:49:01,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:49:01,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 14:49:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:01,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 14:49:01,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:49:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 14:49:02,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:49:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 14:49:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178117056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:49:02,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:49:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-11-10 14:49:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019171097] [2024-11-10 14:49:02,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:49:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 14:49:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:49:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 14:49:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-10 14:49:02,422 INFO L87 Difference]: Start difference. First operand 189 states and 233 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 14:49:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:49:02,952 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2024-11-10 14:49:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 14:49:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2024-11-10 14:49:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:49:02,955 INFO L225 Difference]: With dead ends: 283 [2024-11-10 14:49:02,955 INFO L226 Difference]: Without dead ends: 283 [2024-11-10 14:49:02,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 14:49:02,956 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 95 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:49:02,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 696 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:49:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-10 14:49:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 213. [2024-11-10 14:49:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 193 states have (on average 1.2279792746113989) internal successors, (237), 198 states have internal predecessors, (237), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-10 14:49:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2024-11-10 14:49:02,967 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 51 [2024-11-10 14:49:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:49:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2024-11-10 14:49:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 14:49:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2024-11-10 14:49:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 14:49:02,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:49:02,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:02,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 14:49:03,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:49:03,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:49:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:49:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash -549643678, now seen corresponding path program 1 times [2024-11-10 14:49:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:49:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330672504] [2024-11-10 14:49:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:49:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:49:03,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:49:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:49:03,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:49:03,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:49:03,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 14:49:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 14:49:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:49:03,235 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:03,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:49:03,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:49:03 BoogieIcfgContainer [2024-11-10 14:49:03,275 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:49:03,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:49:03,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:49:03,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:49:03,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:36" (3/4) ... [2024-11-10 14:49:03,277 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:49:03,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:49:03,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:49:03,336 INFO L158 Benchmark]: Toolchain (without parser) took 27647.11ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 104.7MB in the beginning and 74.0MB in the end (delta: 30.7MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,336 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:49:03,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.61ms. Allocated memory is still 172.0MB. Free memory was 104.2MB in the beginning and 121.7MB in the end (delta: -17.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.71ms. Allocated memory is still 172.0MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,336 INFO L158 Benchmark]: Boogie Preprocessor took 61.28ms. Allocated memory is still 172.0MB. Free memory was 119.6MB in the beginning and 116.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,337 INFO L158 Benchmark]: IcfgBuilder took 441.98ms. Allocated memory is still 172.0MB. Free memory was 116.0MB in the beginning and 96.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,337 INFO L158 Benchmark]: TraceAbstraction took 26507.83ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 95.8MB in the beginning and 77.1MB in the end (delta: 18.7MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,337 INFO L158 Benchmark]: Witness Printer took 59.60ms. Allocated memory is still 228.6MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:49:03,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.61ms. Allocated memory is still 172.0MB. Free memory was 104.2MB in the beginning and 121.7MB in the end (delta: -17.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.71ms. Allocated memory is still 172.0MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.28ms. Allocated memory is still 172.0MB. Free memory was 119.6MB in the beginning and 116.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 441.98ms. Allocated memory is still 172.0MB. Free memory was 116.0MB in the beginning and 96.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26507.83ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 95.8MB in the beginning and 77.1MB in the end (delta: 18.7MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * Witness Printer took 59.60ms. Allocated memory is still 228.6MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L620] int len = from; VAL [\old(from)=2, \old(until)=5, len=2, until=5] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, len=2, until=5] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; VAL [\old(from)=2, \old(until)=5, \result=2, until=5] [L627] RET, EXPR _get_nondet_int(2, 5) [L627] const int len = _get_nondet_int(2, 5); [L628] SLL s = sll_create(len); [L628] CALL, EXPR sll_create(len) [L575] SLL head = ((void *)0); VAL [head={0:0}, len=2] [L576] EXPR len-- VAL [head={0:0}, len=1] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=1, new_head={-1:0}] [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- VAL [head={-1:0}, len=0] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=0, new_head={-2:0}] [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- VAL [head={-2:0}, len=-1] [L576] COND FALSE !(len-- > 0) [L584] return head; VAL [\result={-2:0}, len=-1] [L628] RET, EXPR sll_create(len) [L628] SLL s = sll_create(len); [L629] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L620] int len = from; VAL [\old(from)=0, \old(until)=1, len=0, until=1] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, len=0, until=1] [L621] COND TRUE len < until && __VERIFIER_nondet_int() [L622] len++ VAL [\old(from)=0, \old(until)=1, len=1, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, len=1, until=1] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; VAL [\old(from)=0, \old(until)=1, \result=1, until=1] [L629] RET, EXPR _get_nondet_int(0, len - 1) VAL [len=2, s={3:0}] [L629] const int k = _get_nondet_int(0, len - 1); [L630] int i = 0; VAL [i=0, k=1, len=2, s={3:0}] [L631] i < k && __VERIFIER_nondet_int() [L631] i < k && __VERIFIER_nondet_int() VAL [i=0, k=1, len=2, s={3:0}] [L631] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L636] EXPR \read(s) [L636] CALL, EXPR sll_length(s) [L587] int len = 0; VAL [head={-2:0}, len=0] [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND FALSE !(\read(head)) VAL [len=2] [L592] return len; VAL [\result=2] [L636] RET, EXPR sll_length(s) [L636] COND TRUE k + len != sll_length(s) [L641] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_nondet_insert-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 4577 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4055 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1792 IncrementalHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 522 mSDtfsCounter, 1792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 494 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 239 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 924 ConstructedInterpolants, 20 QuantifiedInterpolants, 5897 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1221 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 228/375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:49:03,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)