./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers1-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/memsafety-ext3/getNumbers1-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 1fb17cc8fe5a0faedd7397d9dad19c9fd18716037f6fbcc01ca4a50f1481e06c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:20:50,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:20:50,180 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:20:50,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:20:50,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:20:50,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:20:50,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:20:50,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:20:50,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:20:50,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:20:50,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:20:50,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:20:50,202 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:20:50,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:20:50,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:20:50,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:20:50,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:20:50,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:20:50,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:20:50,204 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 -> 1fb17cc8fe5a0faedd7397d9dad19c9fd18716037f6fbcc01ca4a50f1481e06c [2025-02-06 10:20:50,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:20:50,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:20:50,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:20:50,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:20:50,422 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:20:50,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c [2025-02-06 10:20:51,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ea88aff5/f853c0629dbd451e8fa0dfa6e1a9bfd7/FLAGbb1c49433 [2025-02-06 10:20:51,761 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:20:51,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c [2025-02-06 10:20:51,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ea88aff5/f853c0629dbd451e8fa0dfa6e1a9bfd7/FLAGbb1c49433 [2025-02-06 10:20:52,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ea88aff5/f853c0629dbd451e8fa0dfa6e1a9bfd7 [2025-02-06 10:20:52,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:20:52,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:20:52,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:20:52,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:20:52,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:20:52,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22157af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52, skipping insertion in model container [2025-02-06 10:20:52,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:20:52,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:20:52,236 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:20:52,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:20:52,251 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:20:52,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52 WrapperNode [2025-02-06 10:20:52,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:20:52,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:20:52,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:20:52,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:20:52,256 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:20:52" (1/1) ... [2025-02-06 10:20:52,259 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:20:52" (1/1) ... [2025-02-06 10:20:52,267 INFO L138 Inliner]: procedures = 10, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-02-06 10:20:52,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:20:52,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:20:52,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:20:52,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:20:52,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,279 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [10]. The 1 writes are split as follows [1]. [2025-02-06 10:20:52,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:20:52,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:20:52,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:20:52,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:20:52,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (1/1) ... [2025-02-06 10:20:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:20:52,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:52,307 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:20:52,311 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:20:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:20:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:20:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:20:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:20:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:20:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:20:52,362 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:20:52,363 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:20:52,443 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 10:20:52,443 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:20:52,449 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:20:52,449 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:20:52,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:20:52 BoogieIcfgContainer [2025-02-06 10:20:52,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:20:52,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:20:52,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:20:52,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:20:52,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:20:52" (1/3) ... [2025-02-06 10:20:52,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275affc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:20:52, skipping insertion in model container [2025-02-06 10:20:52,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:20:52" (2/3) ... [2025-02-06 10:20:52,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275affc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:20:52, skipping insertion in model container [2025-02-06 10:20:52,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:20:52" (3/3) ... [2025-02-06 10:20:52,457 INFO L128 eAbstractionObserver]: Analyzing ICFG getNumbers1-2.c [2025-02-06 10:20:52,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:20:52,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG getNumbers1-2.c that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-02-06 10:20:52,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:20:52,503 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;@76919c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:20:52,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 10:20:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 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:20:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:20:52,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:52,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:20:52,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:52,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1476606, now seen corresponding path program 1 times [2025-02-06 10:20:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:52,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623153824] [2025-02-06 10:20:52,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:20:52,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:20:52,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:52,701 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:20:52,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623153824] [2025-02-06 10:20:52,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623153824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:52,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:20:52,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 10:20:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504459952] [2025-02-06 10:20:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:52,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:20:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:52,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:20:52,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:20:52,733 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:20:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:52,784 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-02-06 10:20:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:20:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-06 10:20:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:52,797 INFO L225 Difference]: With dead ends: 16 [2025-02-06 10:20:52,798 INFO L226 Difference]: Without dead ends: 14 [2025-02-06 10:20:52,804 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:20:52,806 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:52,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-06 10:20:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-06 10:20:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 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:20:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-02-06 10:20:52,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2025-02-06 10:20:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:52,849 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-06 10:20:52,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:20:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-02-06 10:20:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:20:52,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:52,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:20:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:20:52,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1476607, now seen corresponding path program 1 times [2025-02-06 10:20:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121229800] [2025-02-06 10:20:52,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:52,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:20:52,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:20:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:53,095 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:20:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121229800] [2025-02-06 10:20:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121229800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:20:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:20:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466026661] [2025-02-06 10:20:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:20:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:53,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:20:53,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:20:53,101 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:20:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:53,156 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-06 10:20:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:20:53,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 10:20:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:53,158 INFO L225 Difference]: With dead ends: 17 [2025-02-06 10:20:53,158 INFO L226 Difference]: Without dead ends: 17 [2025-02-06 10:20:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:20:53,158 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:53,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-06 10:20:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-06 10:20:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-02-06 10:20:53,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 4 [2025-02-06 10:20:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:53,166 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-02-06 10:20:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:20:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-02-06 10:20:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:20:53,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:53,166 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 10:20:53,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:20:53,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1039878638, now seen corresponding path program 1 times [2025-02-06 10:20:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082658378] [2025-02-06 10:20:53,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:20:53,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:20:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082658378] [2025-02-06 10:20:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082658378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:20:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102319265] [2025-02-06 10:20:53,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:53,362 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:20:53,363 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:20:53,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:20:53,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:20:53,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:53,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:53,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:20:53,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:20:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:53,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:20:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:53,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102319265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:20:53,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:20:53,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-02-06 10:20:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451780836] [2025-02-06 10:20:53,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:20:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:20:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:53,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:20:53,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:20:53,693 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:53,847 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-06 10:20:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:20:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:20:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:53,849 INFO L225 Difference]: With dead ends: 23 [2025-02-06 10:20:53,849 INFO L226 Difference]: Without dead ends: 23 [2025-02-06 10:20:53,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:20:53,852 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:53,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 23 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:20:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-06 10:20:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-06 10:20:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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:20:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-06 10:20:53,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 7 [2025-02-06 10:20:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-06 10:20:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-06 10:20:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:20:53,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:53,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:53,869 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:20:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:54,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1851151492, now seen corresponding path program 1 times [2025-02-06 10:20:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698622711] [2025-02-06 10:20:54,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:54,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:20:54,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:20:54,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:54,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:20:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698622711] [2025-02-06 10:20:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698622711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:20:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:20:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277867587] [2025-02-06 10:20:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:20:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:54,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:20:54,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:20:54,129 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:20:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:54,144 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-02-06 10:20:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:20:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 18 [2025-02-06 10:20:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:54,145 INFO L225 Difference]: With dead ends: 27 [2025-02-06 10:20:54,145 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 10:20:54,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20:54,146 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:54,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 10:20:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-02-06 10:20:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-02-06 10:20:54,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2025-02-06 10:20:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:54,150 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-02-06 10:20:54,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:20:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-02-06 10:20:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:20:54,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:54,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:54,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:20:54,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:54,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1851151332, now seen corresponding path program 1 times [2025-02-06 10:20:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123872255] [2025-02-06 10:20:54,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:54,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:20:54,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:20:54,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:20:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123872255] [2025-02-06 10:20:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123872255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:20:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:20:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919746956] [2025-02-06 10:20:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:20:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:20:54,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:20:54,226 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:20:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:54,250 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-06 10:20:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:20:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 18 [2025-02-06 10:20:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:54,251 INFO L225 Difference]: With dead ends: 23 [2025-02-06 10:20:54,251 INFO L226 Difference]: Without dead ends: 23 [2025-02-06 10:20:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:20:54,251 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:54,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-06 10:20:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-06 10:20:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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:20:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-06 10:20:54,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2025-02-06 10:20:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:54,254 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-06 10:20:54,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:20:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-06 10:20:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:20:54,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:54,255 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:54,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:20:54,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:54,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1851151331, now seen corresponding path program 1 times [2025-02-06 10:20:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389478339] [2025-02-06 10:20:54,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:20:54,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:20:54,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:54,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389478339] [2025-02-06 10:20:54,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389478339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:20:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944433738] [2025-02-06 10:20:54,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:54,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:54,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:54,338 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:20:54,339 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:20:54,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:20:54,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:20:54,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:54,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:20:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:20:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:54,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:20:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:20:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944433738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:20:54,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:20:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 10:20:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113797004] [2025-02-06 10:20:54,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:20:54,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:20:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:54,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:20:54,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:20:54,517 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:20:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:54,563 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2025-02-06 10:20:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:20:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-02-06 10:20:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:54,564 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:20:54,564 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:20:54,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:20:54,565 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:54,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:20:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 10:20:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 40 states have internal predecessors, (42), 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:20:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2025-02-06 10:20:54,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 18 [2025-02-06 10:20:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:54,568 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2025-02-06 10:20:54,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:20:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2025-02-06 10:20:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:20:54,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:54,568 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:54,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:20:54,769 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:20:54,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:54,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1514304259, now seen corresponding path program 2 times [2025-02-06 10:20:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858595544] [2025-02-06 10:20:54,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:20:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:54,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:20:54,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 10:20:54,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:20:54,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858595544] [2025-02-06 10:20:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858595544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:20:54,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:20:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44080860] [2025-02-06 10:20:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:54,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:20:54,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:54,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:20:54,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:20:54,896 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:20:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:54,952 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-02-06 10:20:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:20:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 36 [2025-02-06 10:20:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:54,953 INFO L225 Difference]: With dead ends: 43 [2025-02-06 10:20:54,953 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 10:20:54,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:20:54,954 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:54,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 10:20:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-02-06 10:20:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 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:20:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-02-06 10:20:54,957 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2025-02-06 10:20:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:54,957 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-02-06 10:20:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:20:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-02-06 10:20:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:20:54,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:54,958 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:54,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:20:54,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:54,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1698241671, now seen corresponding path program 1 times [2025-02-06 10:20:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511247084] [2025-02-06 10:20:54,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:54,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:20:54,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:20:54,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:54,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511247084] [2025-02-06 10:20:55,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511247084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:20:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996906264] [2025-02-06 10:20:55,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:55,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:55,011 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:20:55,012 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:20:55,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:20:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:20:55,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:55,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:55,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 10:20:55,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:20:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:20:55,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:20:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996906264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:20:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 10:20:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308159924] [2025-02-06 10:20:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:20:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:55,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:20:55,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:20:55,104 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:55,107 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2025-02-06 10:20:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:20:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-06 10:20:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:55,108 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:20:55,108 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:20:55,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:20:55,109 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:55,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:20:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 10:20:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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:20:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-02-06 10:20:55,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 39 [2025-02-06 10:20:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:55,111 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-02-06 10:20:55,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-02-06 10:20:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:20:55,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:55,111 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:55,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:20:55,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:55,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1698241832, now seen corresponding path program 1 times [2025-02-06 10:20:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981141701] [2025-02-06 10:20:55,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:55,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:20:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:20:55,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981141701] [2025-02-06 10:20:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981141701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:20:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717634061] [2025-02-06 10:20:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:20:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:55,473 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:20:55,474 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:20:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:20:55,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:20:55,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:20:55,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:55,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:20:55,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:20:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:55,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:20:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717634061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:20:55,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:20:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-06 10:20:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267916258] [2025-02-06 10:20:55,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:20:55,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:20:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:20:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:20:55,899 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:20:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:56,000 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-02-06 10:20:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:20:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 39 [2025-02-06 10:20:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:56,001 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:20:56,001 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:20:56,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:20:56,002 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:56,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:20:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 10:20:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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:20:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-02-06 10:20:56,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 39 [2025-02-06 10:20:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:56,004 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-02-06 10:20:56,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:20:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-02-06 10:20:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:20:56,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:20:56,005 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 10:20:56,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:20:56,205 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,SelfDestructingSolverStorable8 [2025-02-06 10:20:56,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-02-06 10:20:56,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:20:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1619063491, now seen corresponding path program 2 times [2025-02-06 10:20:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:20:56,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441785817] [2025-02-06 10:20:56,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:20:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:20:56,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 10:20:56,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:20:56,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:20:56,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:20:56,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441785817] [2025-02-06 10:20:56,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441785817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:20:56,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627857633] [2025-02-06 10:20:56,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:20:56,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:20:56,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:20:56,480 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:20:56,481 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:20:56,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 10:20:56,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:20:56,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:20:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:20:56,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:20:56,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:20:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:20:56,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:20:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627857633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:20:56,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:20:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2025-02-06 10:20:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797490449] [2025-02-06 10:20:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:20:56,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:20:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:20:56,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:20:56,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:20:56,869 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:20:56,992 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-02-06 10:20:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:20:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-06 10:20:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:20:56,993 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:20:56,993 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:20:56,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:20:56,993 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:20:56,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:20:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:20:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:20:56,994 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:20:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:20:56,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2025-02-06 10:20:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:20:56,994 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:20:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:20:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:20:56,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:20:56,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-06 10:20:56,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2025-02-06 10:20:56,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-02-06 10:20:56,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-02-06 10:20:56,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2025-02-06 10:20:57,002 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:20:57,197 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,SelfDestructingSolverStorable9 [2025-02-06 10:20:57,199 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:20:57,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:20:57,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:20:57 BoogieIcfgContainer [2025-02-06 10:20:57,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:20:57,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:20:57,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:20:57,203 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:20:57,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:20:52" (3/4) ... [2025-02-06 10:20:57,206 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:20:57,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 10:20:57,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 10:20:57,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 10:20:57,255 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:20:57,255 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:20:57,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:20:57,256 INFO L158 Benchmark]: Toolchain (without parser) took 5118.50ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 114.4MB in the beginning and 82.2MB in the end (delta: 32.2MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 113.79ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 103.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.47ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 996.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: Boogie Preprocessor took 16.76ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: IcfgBuilder took 164.95ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 90.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: TraceAbstraction took 4750.17ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.6MB in the beginning and 87.8MB in the end (delta: 1.8MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-02-06 10:20:57,256 INFO L158 Benchmark]: Witness Printer took 52.48ms. Allocated memory is still 176.2MB. Free memory was 87.8MB in the beginning and 82.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:20:57,257 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 113.79ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 103.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.47ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 996.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.76ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 164.95ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 90.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4750.17ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.6MB in the beginning and 87.8MB in the end (delta: 1.8MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 52.48ms. Allocated memory is still 176.2MB. Free memory was 87.8MB in the beginning and 82.2MB in the end (delta: 5.6MB). There was no memory consumed. 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: 15]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 75 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=9, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 382 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 3814 SizeOfPredicates, 4 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 1240/1336 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:20:57,267 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