./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test23-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test23-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:13:12,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:13:12,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:13:12,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:13:12,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:13:12,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:13:12,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:13:12,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:13:12,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:13:12,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:13:12,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:13:12,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:13:12,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:13:12,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:12,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:13:12,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:13:12,395 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-jdk21/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 -> 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 [2025-02-06 10:13:12,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:13:12,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:13:12,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:13:12,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:13:12,589 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:13:12,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-2.c [2025-02-06 10:13:13,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c658930/4ffb256ace244f5cbd3b9f8672acd3fe/FLAG4951b189d [2025-02-06 10:13:13,967 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:13:13,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-2.c [2025-02-06 10:13:13,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c658930/4ffb256ace244f5cbd3b9f8672acd3fe/FLAG4951b189d [2025-02-06 10:13:14,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c658930/4ffb256ace244f5cbd3b9f8672acd3fe [2025-02-06 10:13:14,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:13:14,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:13:14,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:14,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:13:14,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:13:14,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14, skipping insertion in model container [2025-02-06 10:13:14,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:13:14,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:14,478 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:13:14,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:14,509 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:13:14,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14 WrapperNode [2025-02-06 10:13:14,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:14,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:14,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:13:14,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:13:14,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,537 INFO L138 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2025-02-06 10:13:14,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:14,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:13:14,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:13:14,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:13:14,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,565 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2025-02-06 10:13:14,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:13:14,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:13:14,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:13:14,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:13:14,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (1/1) ... [2025-02-06 10:13:14,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:14,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:13:14,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-02-06 10:13:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:13:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:13:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:13:14,665 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:13:14,666 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:13:14,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~nondet8; [2025-02-06 10:13:14,875 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc check_#t~mem9#1; [2025-02-06 10:13:14,882 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-06 10:13:14,883 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:13:14,889 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:13:14,889 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:13:14,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:14 BoogieIcfgContainer [2025-02-06 10:13:14,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:13:14,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:13:14,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:13:14,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:13:14,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:13:14" (1/3) ... [2025-02-06 10:13:14,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2362c22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:14, skipping insertion in model container [2025-02-06 10:13:14,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:14" (2/3) ... [2025-02-06 10:13:14,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2362c22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:14, skipping insertion in model container [2025-02-06 10:13:14,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:14" (3/3) ... [2025-02-06 10:13:14,895 INFO L128 eAbstractionObserver]: Analyzing ICFG test23-2.c [2025-02-06 10:13:14,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:13:14,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test23-2.c that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-02-06 10:13:14,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:13:14,934 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;@5a2cf02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:13:14,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 10:13:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 states have internal predecessors, (56), 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-02-06 10:13:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:13:14,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:14,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:13:14,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 95296, now seen corresponding path program 1 times [2025-02-06 10:13:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779881617] [2025-02-06 10:13:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:14,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:13:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:13:15,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:15,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779881617] [2025-02-06 10:13:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779881617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 10:13:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321624762] [2025-02-06 10:13:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:15,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:15,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,262 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 states have internal predecessors, (56), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-02-06 10:13:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:15,348 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-02-06 10:13:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2025-02-06 10:13:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:15,354 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:13:15,359 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:13:15,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,368 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:15,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:13:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:13:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.53125) internal successors, (49), 47 states have internal predecessors, (49), 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-02-06 10:13:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-02-06 10:13:15,405 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 3 [2025-02-06 10:13:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:15,407 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-06 10:13:15,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-02-06 10:13:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-02-06 10:13:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:13:15,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:15,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:13:15,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:13:15,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:15,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 95295, now seen corresponding path program 1 times [2025-02-06 10:13:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636556224] [2025-02-06 10:13:15,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:15,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:13:15,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:13:15,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636556224] [2025-02-06 10:13:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636556224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 10:13:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246281625] [2025-02-06 10:13:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:15,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:15,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:15,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,548 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-02-06 10:13:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:15,611 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-02-06 10:13:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2025-02-06 10:13:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:15,616 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:13:15,616 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:13:15,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,617 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:15,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:13:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 10:13:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 45 states have internal predecessors, (47), 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-02-06 10:13:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-02-06 10:13:15,629 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 3 [2025-02-06 10:13:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-02-06 10:13:15,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-02-06 10:13:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-02-06 10:13:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:13:15,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:15,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:15,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:13:15,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:15,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2108539065, now seen corresponding path program 1 times [2025-02-06 10:13:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634096323] [2025-02-06 10:13:15,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:15,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:13:15,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:13:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634096323] [2025-02-06 10:13:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634096323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 10:13:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664687449] [2025-02-06 10:13:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:15,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:15,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,738 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:15,761 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-02-06 10:13:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:15,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:13:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:15,763 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:13:15,763 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:13:15,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,763 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:15,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:13:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:13:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.40625) internal successors, (45), 43 states have internal predecessors, (45), 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-02-06 10:13:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-02-06 10:13:15,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 7 [2025-02-06 10:13:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:15,767 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-02-06 10:13:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-02-06 10:13:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:13:15,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:15,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:13:15,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2108539066, now seen corresponding path program 1 times [2025-02-06 10:13:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861119022] [2025-02-06 10:13:15,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:15,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:13:15,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:13:15,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:15,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861119022] [2025-02-06 10:13:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861119022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 10:13:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044936715] [2025-02-06 10:13:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:15,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,851 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:15,871 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-02-06 10:13:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:13:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:15,873 INFO L225 Difference]: With dead ends: 45 [2025-02-06 10:13:15,873 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 10:13:15,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:15,873 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:15,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 34 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 10:13:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 10:13:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 41 states have internal predecessors, (43), 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-02-06 10:13:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-02-06 10:13:15,878 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 7 [2025-02-06 10:13:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:15,879 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-02-06 10:13:15,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-02-06 10:13:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:13:15,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:15,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:15,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:13:15,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1997782160, now seen corresponding path program 1 times [2025-02-06 10:13:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126560543] [2025-02-06 10:13:15,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:15,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:13:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:13:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126560543] [2025-02-06 10:13:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126560543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728828268] [2025-02-06 10:13:16,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:16,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:16,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:13:16,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:13:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:13:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:16,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:13:16,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:16,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:13:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728828268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:16,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:13:16,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 13 [2025-02-06 10:13:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120032283] [2025-02-06 10:13:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:16,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:13:16,638 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-02-06 10:13:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:16,738 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-02-06 10:13:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:13:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 23 [2025-02-06 10:13:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:16,739 INFO L225 Difference]: With dead ends: 43 [2025-02-06 10:13:16,739 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 10:13:16,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:13:16,741 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:16,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 82 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 10:13:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 10:13:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 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-02-06 10:13:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-02-06 10:13:16,747 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 23 [2025-02-06 10:13:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:16,748 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-02-06 10:13:16,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-02-06 10:13:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-02-06 10:13:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:13:16,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:16,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:16,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:13:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:16,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:16,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1997782159, now seen corresponding path program 1 times [2025-02-06 10:13:16,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383081123] [2025-02-06 10:13:16,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:13:16,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:13:16,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:16,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383081123] [2025-02-06 10:13:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383081123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815740592] [2025-02-06 10:13:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:17,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:13:17,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:13:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:13:17,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:17,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:17,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:13:17,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:18,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:13:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815740592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:13:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-02-06 10:13:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4296161] [2025-02-06 10:13:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:13:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:18,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:13:18,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:13:18,091 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-02-06 10:13:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:18,295 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-02-06 10:13:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:13:18,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2025-02-06 10:13:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:18,296 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:13:18,296 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:13:18,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:13:18,296 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:18,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 168 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:13:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 10:13:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 37 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-02-06 10:13:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-02-06 10:13:18,299 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 23 [2025-02-06 10:13:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:18,299 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-02-06 10:13:18,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-02-06 10:13:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-02-06 10:13:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:13:18,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:18,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:18,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:13:18,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:18,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1801704750, now seen corresponding path program 1 times [2025-02-06 10:13:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-02-06 10:13:18,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:18,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:13:18,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:13:18,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-02-06 10:13:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847511481] [2025-02-06 10:13:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:18,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:18,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:18,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:18,582 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:18,601 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-02-06 10:13:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-06 10:13:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:18,602 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:13:18,602 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:13:18,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:18,604 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:18,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:13:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:13:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 34 states have internal predecessors, (35), 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-02-06 10:13:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-02-06 10:13:18,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2025-02-06 10:13:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:18,606 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-06 10:13:18,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-02-06 10:13:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:13:18,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:18,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:18,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:13:18,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:18,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1054307252, now seen corresponding path program 1 times [2025-02-06 10:13:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-02-06 10:13:18,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:18,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:13:18,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:13:18,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:18,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-02-06 10:13:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399878963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073444720] [2025-02-06 10:13:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:18,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:18,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:18,734 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:18,773 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-06 10:13:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:13:18,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-06 10:13:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:18,777 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:13:18,777 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:13:18,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:18,778 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:18,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:13:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 10:13:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 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-02-06 10:13:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-02-06 10:13:18,780 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2025-02-06 10:13:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:18,780 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-06 10:13:18,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-02-06 10:13:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:13:18,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:18,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:18,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:13:18,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:18,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1054307253, now seen corresponding path program 1 times [2025-02-06 10:13:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511652971] [2025-02-06 10:13:18,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:18,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:13:18,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:13:18,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:18,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511652971] [2025-02-06 10:13:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511652971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937995579] [2025-02-06 10:13:19,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:19,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:19,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:19,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:19,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:13:19,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:13:19,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:13:19,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:19,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:19,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:13:19,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:19,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:13:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937995579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:19,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:13:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2025-02-06 10:13:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271321872] [2025-02-06 10:13:19,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:19,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:19,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:19,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:13:19,363 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:19,413 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-02-06 10:13:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-06 10:13:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:19,415 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:13:19,415 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:13:19,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:13:19,416 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:19,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 89 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:13:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 10:13:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:13:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-02-06 10:13:19,417 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 28 [2025-02-06 10:13:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:19,418 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-02-06 10:13:19,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-02-06 10:13:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:13:19,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:19,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:19,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:13:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:19,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:19,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash -228494394, now seen corresponding path program 1 times [2025-02-06 10:13:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863238672] [2025-02-06 10:13:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:19,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:13:19,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:13:19,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:19,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863238672] [2025-02-06 10:13:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863238672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837809161] [2025-02-06 10:13:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:19,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:19,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:19,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:19,692 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:19,731 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-02-06 10:13:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:13:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-06 10:13:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:19,731 INFO L225 Difference]: With dead ends: 35 [2025-02-06 10:13:19,732 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 10:13:19,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:19,732 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 10:13:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 10:13:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 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-02-06 10:13:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-02-06 10:13:19,734 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2025-02-06 10:13:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:19,734 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-02-06 10:13:19,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:13:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-02-06 10:13:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:13:19,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:19,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:19,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:13:19,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -228494393, now seen corresponding path program 1 times [2025-02-06 10:13:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483949785] [2025-02-06 10:13:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:13:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:13:19,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:19,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:22,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483949785] [2025-02-06 10:13:22,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483949785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:22,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:22,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:13:22,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877615060] [2025-02-06 10:13:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:13:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:22,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:13:22,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:13:22,779 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-02-06 10:13:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:23,366 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-02-06 10:13:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:13:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 31 [2025-02-06 10:13:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:23,367 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:13:23,367 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:13:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:13:23,368 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:23,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 166 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:13:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:13:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 10:13:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 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-02-06 10:13:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-02-06 10:13:23,371 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2025-02-06 10:13:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-02-06 10:13:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-02-06 10:13:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-02-06 10:13:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:13:23,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:23,376 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, 1, 1, 1, 1, 1] [2025-02-06 10:13:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:13:23,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 482925076, now seen corresponding path program 1 times [2025-02-06 10:13:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-02-06 10:13:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:13:23,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:13:23,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:23,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:24,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-02-06 10:13:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100622721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724819725] [2025-02-06 10:13:24,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:24,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:24,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:24,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:24,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:13:24,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:13:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:13:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:24,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:13:24,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:24,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:13:25,201 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2025-02-06 10:13:25,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 25 [2025-02-06 10:13:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:25,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:25,411 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 32 treesize of output 23 [2025-02-06 10:13:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724819725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:25,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 29 [2025-02-06 10:13:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628975189] [2025-02-06 10:13:25,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:13:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:25,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:13:25,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:13:25,432 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:26,137 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2025-02-06 10:13:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:13:26,138 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-02-06 10:13:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:26,138 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:13:26,138 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:13:26,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:13:26,139 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:26,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 404 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:13:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:13:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:13:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 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-02-06 10:13:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-02-06 10:13:26,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 34 [2025-02-06 10:13:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:26,141 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-02-06 10:13:26,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-02-06 10:13:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:13:26,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:26,146 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:26,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:13:26,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 10:13:26,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 807914887, now seen corresponding path program 2 times [2025-02-06 10:13:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-06 10:13:26,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:13:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:26,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-06 10:13:26,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:13:26,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:13:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-06 10:13:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817606132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:27,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267841998] [2025-02-06 10:13:27,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:13:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:27,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:27,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:13:27,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-06 10:13:27,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:13:27,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:13:27,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:27,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:13:27,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:27,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:13:27,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:27,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-02-06 10:13:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:27,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:27,928 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 32 treesize of output 23 [2025-02-06 10:13:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267841998] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:27,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:27,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2025-02-06 10:13:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13398646] [2025-02-06 10:13:27,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:27,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:13:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:13:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:13:27,938 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:29,139 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-02-06 10:13:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:13:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-02-06 10:13:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:29,141 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:13:29,141 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:13:29,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:13:29,145 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 61 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:29,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 479 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:13:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:13:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:13:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 61 states have internal predecessors, (62), 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-02-06 10:13:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-02-06 10:13:29,150 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 43 [2025-02-06 10:13:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:29,150 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-02-06 10:13:29,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-02-06 10:13:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 10:13:29,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:29,155 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:29,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:13:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 10:13:29,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -803592153, now seen corresponding path program 3 times [2025-02-06 10:13:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667335113] [2025-02-06 10:13:29,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:13:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:29,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 11 equivalence classes. [2025-02-06 10:13:29,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 61 statements. [2025-02-06 10:13:29,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 10:13:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-06 10:13:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667335113] [2025-02-06 10:13:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667335113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815497735] [2025-02-06 10:13:30,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:13:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:30,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:30,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:13:30,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 11 equivalence classes. [2025-02-06 10:13:30,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 61 statements. [2025-02-06 10:13:30,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 10:13:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:30,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:13:30,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:30,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:13:31,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:31,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 80 [2025-02-06 10:13:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-06 10:13:31,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:32,299 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 199 treesize of output 172 [2025-02-06 10:13:32,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 183 treesize of output 169 [2025-02-06 10:13:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-06 10:13:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815497735] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:32,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2025-02-06 10:13:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387036886] [2025-02-06 10:13:32,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:32,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:13:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:32,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:13:32,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:13:32,357 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:32,935 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2025-02-06 10:13:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:13:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-02-06 10:13:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:32,936 INFO L225 Difference]: With dead ends: 64 [2025-02-06 10:13:32,936 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 10:13:32,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=1358, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:13:32,937 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:32,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 346 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:13:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 10:13:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 10:13:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 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-02-06 10:13:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2025-02-06 10:13:32,940 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2025-02-06 10:13:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:32,940 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2025-02-06 10:13:32,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2025-02-06 10:13:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:13:32,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:32,941 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:32,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:13:33,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 10:13:33,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:33,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1304171253, now seen corresponding path program 1 times [2025-02-06 10:13:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333753051] [2025-02-06 10:13:33,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:33,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:13:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:13:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:33,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333753051] [2025-02-06 10:13:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333753051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452994855] [2025-02-06 10:13:35,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:35,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:35,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:13:35,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:13:35,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:13:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:35,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:13:35,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:35,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:13:36,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-06 10:13:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:36,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:37,783 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:13:37,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 1 [2025-02-06 10:13:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452994855] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:37,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 63 [2025-02-06 10:13:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702973537] [2025-02-06 10:13:37,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:37,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 10:13:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:37,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 10:13:37,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3418, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 10:13:37,796 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 62 states have internal predecessors, (153), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:43,003 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2025-02-06 10:13:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-06 10:13:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 62 states have internal predecessors, (153), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-02-06 10:13:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:43,004 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:13:43,004 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:13:43,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4195 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2769, Invalid=13743, Unknown=0, NotChecked=0, Total=16512 [2025-02-06 10:13:43,010 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 345 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:43,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 790 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:13:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:13:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 10:13:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 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-02-06 10:13:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-02-06 10:13:43,016 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 66 [2025-02-06 10:13:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-02-06 10:13:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 62 states have internal predecessors, (153), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-02-06 10:13:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 10:13:43,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:43,017 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:43,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:13:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:43,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-02-06 10:13:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -75384885, now seen corresponding path program 2 times [2025-02-06 10:13:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:43,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-02-06 10:13:43,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:13:43,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:43,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-02-06 10:13:43,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 10:13:43,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:13:43,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 739 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:13:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-02-06 10:13:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684936755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595692407] [2025-02-06 10:13:45,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:13:45,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:45,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:45,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:45,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:13:45,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-02-06 10:13:45,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 10:13:45,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:13:45,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:13:45,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:45,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:13:46,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:46,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-02-06 10:13:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 738 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:47,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:48,195 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 47 treesize of output 23 [2025-02-06 10:13:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 738 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:13:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595692407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:48,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29, 29] total 78 [2025-02-06 10:13:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671323923] [2025-02-06 10:13:48,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-02-06 10:13:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:48,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-02-06 10:13:48,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=4990, Unknown=0, NotChecked=0, Total=6006 [2025-02-06 10:13:48,208 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 78 states, 78 states have (on average 2.8974358974358974) internal successors, (226), 77 states have internal predecessors, (226), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:49,364 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2025-02-06 10:13:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:13:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.8974358974358974) internal successors, (226), 77 states have internal predecessors, (226), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 102 [2025-02-06 10:13:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:49,364 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:13:49,364 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:13:49,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 152 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4207 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1494, Invalid=7818, Unknown=0, NotChecked=0, Total=9312 [2025-02-06 10:13:49,367 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:49,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 432 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:13:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:13:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:13:49,368 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-02-06 10:13:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:13:49,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-02-06 10:13:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:49,368 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:13:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.8974358974358974) internal successors, (226), 77 states have internal predecessors, (226), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:13:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:13:49,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:13:49,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-02-06 10:13:49,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-02-06 10:13:49,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-02-06 10:13:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:13:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:13:49,580 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:49,582 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:13:49,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:13:49 BoogieIcfgContainer [2025-02-06 10:13:49,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:13:49,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:13:49,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:13:49,585 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:13:49,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:14" (3/4) ... [2025-02-06 10:13:49,587 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:13:49,591 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-02-06 10:13:49,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 10:13:49,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 10:13:49,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 10:13:49,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:13:49,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:13:49,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:13:49,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:13:49,661 INFO L158 Benchmark]: Toolchain (without parser) took 35347.44ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 105.1MB in the beginning and 409.7MB in the end (delta: -304.6MB). Peak memory consumption was 239.9MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,661 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:49,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.23ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.65ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:49,662 INFO L158 Benchmark]: Boogie Preprocessor took 37.66ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,662 INFO L158 Benchmark]: IcfgBuilder took 310.18ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 72.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,662 INFO L158 Benchmark]: TraceAbstraction took 34694.17ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 72.2MB in the beginning and 415.9MB in the end (delta: -343.7MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,664 INFO L158 Benchmark]: Witness Printer took 74.68ms. Allocated memory is still 687.9MB. Free memory was 415.9MB in the beginning and 409.7MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:49,665 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.11ms. Allocated memory is still 192.9MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.23ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.65ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.66ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 310.18ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 72.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34694.17ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 72.2MB in the beginning and 415.9MB in the end (delta: -343.7MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. * Witness Printer took 74.68ms. Allocated memory is still 687.9MB. Free memory was 415.9MB in the beginning and 409.7MB 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: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - 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, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 16, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 3331 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2882 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3837 IncrementalHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 449 mSDtfsCounter, 3837 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1005 GetRequests, 545 SyntacticMatches, 15 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9732 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=15, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 894 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1171 ConstructedInterpolants, 0 QuantifiedInterpolants, 23329 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2199 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 2698/3441 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:13:49,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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