./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_shallow_copy-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b85925b4cd4a90c7937c0d7134475db048f88e78d985bef01499b1b0477a4b80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:00:57,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:00:57,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 08:00:57,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:00:57,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:00:57,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:00:57,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:00:57,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:00:57,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:00:57,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:00:57,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:00:57,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:00:57,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:00:57,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:00:57,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:00:57,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:00:57,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 08:00:57,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:00:57,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:00:57,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:00:57,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:00:57,531 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b85925b4cd4a90c7937c0d7134475db048f88e78d985bef01499b1b0477a4b80 [2025-03-04 08:00:57,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:00:57,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:00:57,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:00:57,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:00:57,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:00:57,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i [2025-03-04 08:00:58,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8608e92ec/25b432f349ea4adda8cc0ce87d9ce5db/FLAGa386b1807 [2025-03-04 08:00:59,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:00:59,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i [2025-03-04 08:00:59,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8608e92ec/25b432f349ea4adda8cc0ce87d9ce5db/FLAGa386b1807 [2025-03-04 08:00:59,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8608e92ec/25b432f349ea4adda8cc0ce87d9ce5db [2025-03-04 08:00:59,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:00:59,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:00:59,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:00:59,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:00:59,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:00:59,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d35ca35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59, skipping insertion in model container [2025-03-04 08:00:59,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:00:59,356 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 08:00:59,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:00:59,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:00:59,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:00:59,420 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:00:59,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59 WrapperNode [2025-03-04 08:00:59,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:00:59,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:00:59,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:00:59,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:00:59,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,446 INFO L138 Inliner]: procedures = 114, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-03-04 08:00:59,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:00:59,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:00:59,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:00:59,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:00:59,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,466 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 08:00:59,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:00:59,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:00:59,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:00:59,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:00:59,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (1/1) ... [2025-03-04 08:00:59,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:00:59,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:59,509 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) [2025-03-04 08:00:59,511 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 [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2025-03-04 08:00:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:00:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:00:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:00:59,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:00:59,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:00:59,688 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 08:00:59,704 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-04 08:00:59,705 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:00:59,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:00:59,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:00:59,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:00:59 BoogieIcfgContainer [2025-03-04 08:00:59,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:00:59,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:00:59,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:00:59,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:00:59,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:00:59" (1/3) ... [2025-03-04 08:00:59,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce01af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:00:59, skipping insertion in model container [2025-03-04 08:00:59,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:59" (2/3) ... [2025-03-04 08:00:59,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce01af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:00:59, skipping insertion in model container [2025-03-04 08:00:59,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:00:59" (3/3) ... [2025-03-04 08:00:59,721 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-1.i [2025-03-04 08:00:59,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:00:59,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_shallow_copy-1.i that has 2 procedures, 42 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-03-04 08:00:59,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:00:59,769 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;@35070405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:00:59,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 08:00:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 38 states have internal predecessors, (39), 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) [2025-03-04 08:00:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:00:59,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:59,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:59,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:00:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 146944989, now seen corresponding path program 1 times [2025-03-04 08:00:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68762840] [2025-03-04 08:00:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:59,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:00:59,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:00:59,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:59,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68762840] [2025-03-04 08:01:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68762840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596010402] [2025-03-04 08:01:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:00,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:00,245 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) [2025-03-04 08:01:00,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 08:01:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:01:00,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:01:00,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 08:01:00,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:00,331 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 [2025-03-04 08:01:00,373 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |alloc_node_~temp~0#1.base| (select |c_#valid| |alloc_node_~temp~0#1.base|))) (= (select |c_old(#valid)| |alloc_node_~temp~0#1.base|) 0))) is different from true [2025-03-04 08:01:00,456 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 08:01:00,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 08:01:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 08:01:00,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596010402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:00,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 08:01:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-04 08:01:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421839568] [2025-03-04 08:01:00,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 08:01:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:00,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 08:01:00,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-03-04 08:01:00,543 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 08:01:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:00,717 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-04 08:01:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:01:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2025-03-04 08:01:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:00,723 INFO L225 Difference]: With dead ends: 37 [2025-03-04 08:01:00,723 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 08:01:00,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-04 08:01:00,726 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:00,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2025-03-04 08:01:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 08:01:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 08:01:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 30 states have internal predecessors, (30), 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) [2025-03-04 08:01:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2025-03-04 08:01:00,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 16 [2025-03-04 08:01:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:00,754 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2025-03-04 08:01:00,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 08:01:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2025-03-04 08:01:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:01:00,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:00,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:00,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 08:01:00,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash 146944990, now seen corresponding path program 1 times [2025-03-04 08:01:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:00,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-03-04 08:01:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:00,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:01:00,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:01:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-03-04 08:01:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068730413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593274826] [2025-03-04 08:01:01,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:01,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:01,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:01,265 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) [2025-03-04 08:01:01,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 08:01:01,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:01:01,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:01:01,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:01,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 08:01:01,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:01,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:01:01,470 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 08:01:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 08:01:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:01,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593274826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:01,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-03-04 08:01:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668705304] [2025-03-04 08:01:01,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 08:01:01,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:01,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 08:01:01,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 08:01:01,714 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 08:01:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:01,895 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-03-04 08:01:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 08:01:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16 [2025-03-04 08:01:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:01,896 INFO L225 Difference]: With dead ends: 30 [2025-03-04 08:01:01,896 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 08:01:01,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-04 08:01:01,896 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:01,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 08:01:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-04 08:01:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 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) [2025-03-04 08:01:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-03-04 08:01:01,899 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2025-03-04 08:01:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:01,899 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-03-04 08:01:01,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 08:01:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-03-04 08:01:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 08:01:01,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:01,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:01,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:02,100 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,SelfDestructingSolverStorable1 [2025-03-04 08:01:02,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:02,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1536121802, now seen corresponding path program 1 times [2025-03-04 08:01:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:02,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052715257] [2025-03-04 08:01:02,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:02,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 08:01:02,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 08:01:02,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:02,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052715257] [2025-03-04 08:01:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052715257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309458853] [2025-03-04 08:01:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:02,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:02,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:02,173 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) [2025-03-04 08:01:02,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 08:01:02,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 08:01:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 08:01:02,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:02,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 08:01:02,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:02,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309458853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:02,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-04 08:01:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123315360] [2025-03-04 08:01:02,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:01:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:02,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:01:02,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:02,320 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 08:01:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:02,354 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2025-03-04 08:01:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:01:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 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 24 [2025-03-04 08:01:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:02,355 INFO L225 Difference]: With dead ends: 28 [2025-03-04 08:01:02,355 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 08:01:02,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:02,355 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:02,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 08:01:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 08:01:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 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) [2025-03-04 08:01:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-04 08:01:02,361 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2025-03-04 08:01:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:02,361 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-04 08:01:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 08:01:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-04 08:01:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 08:01:02,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:02,362 INFO L218 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] [2025-03-04 08:01:02,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:02,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:02,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:02,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1255697428, now seen corresponding path program 1 times [2025-03-04 08:01:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374688419] [2025-03-04 08:01:02,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:02,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 08:01:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 08:01:02,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:02,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374688419] [2025-03-04 08:01:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374688419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 08:01:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278518194] [2025-03-04 08:01:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:02,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:01:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:02,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:01:02,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:01:02,680 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-03-04 08:01:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:02,735 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2025-03-04 08:01:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 08:01:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2025-03-04 08:01:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:02,735 INFO L225 Difference]: With dead ends: 27 [2025-03-04 08:01:02,735 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 08:01:02,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 08:01:02,736 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:02,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 08:01:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-04 08:01:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 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) [2025-03-04 08:01:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-04 08:01:02,738 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2025-03-04 08:01:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:02,739 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-04 08:01:02,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-03-04 08:01:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-04 08:01:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 08:01:02,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:02,739 INFO L218 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] [2025-03-04 08:01:02,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 08:01:02,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 271914579, now seen corresponding path program 1 times [2025-03-04 08:01:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607893753] [2025-03-04 08:01:02,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 08:01:02,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 08:01:02,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:02,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607893753] [2025-03-04 08:01:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607893753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 08:01:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759629966] [2025-03-04 08:01:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:01:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:02,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:01:02,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:01:02,897 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) [2025-03-04 08:01:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:02,977 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2025-03-04 08:01:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 08:01:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 27 [2025-03-04 08:01:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:02,978 INFO L225 Difference]: With dead ends: 26 [2025-03-04 08:01:02,978 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 08:01:02,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 08:01:02,979 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 08:01:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 08:01:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 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) [2025-03-04 08:01:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-04 08:01:02,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 27 [2025-03-04 08:01:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-04 08:01:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) [2025-03-04 08:01:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-04 08:01:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 08:01:02,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:02,981 INFO L218 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] [2025-03-04 08:01:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 08:01:02,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -160582670, now seen corresponding path program 1 times [2025-03-04 08:01:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413219442] [2025-03-04 08:01:02,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 08:01:02,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 08:01:02,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:02,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413219442] [2025-03-04 08:01:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413219442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:03,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 08:01:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835630866] [2025-03-04 08:01:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:03,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 08:01:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:03,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 08:01:03,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-04 08:01:03,320 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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) [2025-03-04 08:01:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:03,476 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-03-04 08:01:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 08:01:03,476 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 28 [2025-03-04 08:01:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:03,477 INFO L225 Difference]: With dead ends: 25 [2025-03-04 08:01:03,477 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 08:01:03,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 08:01:03,478 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:03,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 08:01:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 08:01:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 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) [2025-03-04 08:01:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-04 08:01:03,480 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 28 [2025-03-04 08:01:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:03,480 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-04 08:01:03,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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) [2025-03-04 08:01:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-04 08:01:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 08:01:03,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:03,481 INFO L218 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, 1] [2025-03-04 08:01:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 08:01:03,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 12 more)] === [2025-03-04 08:01:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -683095504, now seen corresponding path program 1 times [2025-03-04 08:01:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831555445] [2025-03-04 08:01:03,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:03,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 08:01:03,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 08:01:03,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:03,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:03,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831555445] [2025-03-04 08:01:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831555445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710654845] [2025-03-04 08:01:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:03,860 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) [2025-03-04 08:01:03,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 08:01:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 08:01:03,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 08:01:03,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:03,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:03,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 08:01:03,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:04,017 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 08:01:04,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-03-04 08:01:04,043 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 [2025-03-04 08:01:04,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 08:01:04,117 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 29 treesize of output 17 [2025-03-04 08:01:04,175 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 08:01:04,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-03-04 08:01:04,237 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-03-04 08:01:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2025-03-04 08:01:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:04,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:01:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710654845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:01:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 26 [2025-03-04 08:01:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759779985] [2025-03-04 08:01:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 08:01:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:04,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 08:01:04,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2025-03-04 08:01:04,287 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 08:01:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:04,454 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-03-04 08:01:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 08:01:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 1 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 29 [2025-03-04 08:01:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:04,454 INFO L225 Difference]: With dead ends: 24 [2025-03-04 08:01:04,454 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 08:01:04,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2025-03-04 08:01:04,455 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:04,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 08:01:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 08:01:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 08:01:04,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-03-04 08:01:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:04,457 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 08:01:04,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 08:01:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 08:01:04,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 08:01:04,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (13 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (12 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (11 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (10 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (9 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (8 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-04 08:01:04,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-04 08:01:04,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:04,662 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 [2025-03-04 08:01:04,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:04,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 08:01:04,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 08:01:04 BoogieIcfgContainer [2025-03-04 08:01:04,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 08:01:04,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 08:01:04,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 08:01:04,668 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 08:01:04,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:00:59" (3/4) ... [2025-03-04 08:01:04,670 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 08:01:04,673 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alloc_node [2025-03-04 08:01:04,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 08:01:04,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 08:01:04,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 08:01:04,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 08:01:04,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 08:01:04,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 08:01:04,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 08:01:04,725 INFO L158 Benchmark]: Toolchain (without parser) took 5591.73ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.8MB in the beginning and 99.5MB in the end (delta: 12.3MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-03-04 08:01:04,725 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:01:04,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.70ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 95.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:01:04,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.56ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:01:04,726 INFO L158 Benchmark]: Boogie Preprocessor took 26.64ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:01:04,727 INFO L158 Benchmark]: IcfgBuilder took 234.88ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 80.5MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:01:04,728 INFO L158 Benchmark]: TraceAbstraction took 4952.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.9MB in the beginning and 105.6MB in the end (delta: -25.7MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2025-03-04 08:01:04,728 INFO L158 Benchmark]: Witness Printer took 56.76ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 99.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:01:04,729 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.14ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.70ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 95.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.56ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.64ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 234.88ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 80.5MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4952.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.9MB in the beginning and 105.6MB in the end (delta: -25.7MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 56.76ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 99.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1016 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 108 mSDtfsCounter, 1016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 106 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 278 ConstructedInterpolants, 17 QuantifiedInterpolants, 1993 SizeOfPredicates, 4 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 31/65 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 08:01:04,745 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 Result: TRUE