./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/termination-crafted/LexIndexValue-Pointer-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:48:09,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:48:10,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:48:10,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:48:10,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:48:10,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:48:10,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:48:10,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:48:10,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:48:10,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:48:10,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:48:10,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:48:10,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:48:10,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:48:10,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:48:10,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:10,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:10,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:48:10,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:48:10,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:48:10,104 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 [2025-01-09 22:48:10,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:48:10,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:48:10,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:48:10,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:48:10,392 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:48:10,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2025-01-09 22:48:11,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92118fd8b/8701addfdec3415f801921026f331da6/FLAGabf1244fa [2025-01-09 22:48:11,922 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:48:11,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2025-01-09 22:48:11,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92118fd8b/8701addfdec3415f801921026f331da6/FLAGabf1244fa [2025-01-09 22:48:11,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92118fd8b/8701addfdec3415f801921026f331da6 [2025-01-09 22:48:11,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:48:11,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:48:11,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:11,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:48:11,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:48:11,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:11" (1/1) ... [2025-01-09 22:48:11,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e9b033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:11, skipping insertion in model container [2025-01-09 22:48:11,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:11" (1/1) ... [2025-01-09 22:48:11,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:48:12,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:12,134 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:48:12,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:12,159 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:48:12,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12 WrapperNode [2025-01-09 22:48:12,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:12,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:12,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:48:12,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:48:12,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,192 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-01-09 22:48:12,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:12,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:48:12,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:48:12,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:48:12,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,218 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-01-09 22:48:12,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:48:12,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:48:12,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:48:12,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:48:12,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (1/1) ... [2025-01-09 22:48:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:12,275 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-01-09 22:48:12,282 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-01-09 22:48:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:48:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:48:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:48:12,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:48:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:48:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:48:12,357 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:48:12,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:48:12,496 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 22:48:12,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:48:12,504 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:48:12,505 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:48:12,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:12 BoogieIcfgContainer [2025-01-09 22:48:12,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:48:12,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:48:12,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:48:12,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:48:12,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:48:11" (1/3) ... [2025-01-09 22:48:12,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a9a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:12, skipping insertion in model container [2025-01-09 22:48:12,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:12" (2/3) ... [2025-01-09 22:48:12,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480a9a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:12, skipping insertion in model container [2025-01-09 22:48:12,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:12" (3/3) ... [2025-01-09 22:48:12,512 INFO L128 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-2.c [2025-01-09 22:48:12,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:48:12,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LexIndexValue-Pointer-2.c that has 1 procedures, 34 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-01-09 22:48:12,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:48:12,574 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;@442d945a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:48:12,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 22:48:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 33 states have internal predecessors, (38), 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-01-09 22:48:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:48:12,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:12,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:48:12,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:12,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:48:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993157600] [2025-01-09 22:48:12,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:12,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:48:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:48:12,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:12,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993157600] [2025-01-09 22:48:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993157600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:12,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884087614] [2025-01-09 22:48:12,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:12,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:12,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:12,821 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 33 states have internal predecessors, (38), 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), 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-01-09 22:48:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:12,888 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-01-09 22:48:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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-01-09 22:48:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:12,896 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:48:12,896 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:48:12,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:12,902 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:12,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:48:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2025-01-09 22:48:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 36 states have internal predecessors, (45), 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-01-09 22:48:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-01-09 22:48:12,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 4 [2025-01-09 22:48:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-01-09 22:48:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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-01-09 22:48:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-01-09 22:48:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:48:12,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:12,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:48:12,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:48:12,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:48:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:12,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645014991] [2025-01-09 22:48:12,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:12,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:48:12,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:48:12,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:12,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645014991] [2025-01-09 22:48:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645014991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270526365] [2025-01-09 22:48:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:13,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:13,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:13,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:13,068 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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-01-09 22:48:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:13,110 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-01-09 22:48:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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-01-09 22:48:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:13,111 INFO L225 Difference]: With dead ends: 40 [2025-01-09 22:48:13,111 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 22:48:13,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:13,113 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:13,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 22:48:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-01-09 22:48:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 38 states have internal predecessors, (47), 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-01-09 22:48:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-01-09 22:48:13,119 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 4 [2025-01-09 22:48:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:13,119 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-01-09 22:48:13,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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-01-09 22:48:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-01-09 22:48:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:48:13,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:13,120 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:48:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:48:13,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:48:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413619035] [2025-01-09 22:48:13,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:13,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:13,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:13,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413619035] [2025-01-09 22:48:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413619035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519844845] [2025-01-09 22:48:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:13,310 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-01-09 22:48:13,312 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-01-09 22:48:13,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:13,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:13,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:48:13,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:13,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:48:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:13,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519844845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:13,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 22:48:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350161120] [2025-01-09 22:48:13,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:48:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:13,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:48:13,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:13,632 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-01-09 22:48:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:13,787 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-09 22:48:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:48:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-01-09 22:48:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:13,788 INFO L225 Difference]: With dead ends: 46 [2025-01-09 22:48:13,788 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:48:13,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:48:13,789 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:13,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:48:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 22:48:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 45 states have internal predecessors, (54), 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-01-09 22:48:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-09 22:48:13,793 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 7 [2025-01-09 22:48:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-09 22:48:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-01-09 22:48:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-01-09 22:48:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:48:13,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:13,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:13,803 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-01-09 22:48:13,995 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-01-09 22:48:13,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1103290519, now seen corresponding path program 1 times [2025-01-09 22:48:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681944753] [2025-01-09 22:48:13,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:14,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:48:14,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:48:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:48:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681944753] [2025-01-09 22:48:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681944753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202006737] [2025-01-09 22:48:14,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:14,129 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-01-09 22:48:14,131 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-01-09 22:48:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:48:14,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:48:14,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:14,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:48:14,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:14,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:14,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202006737] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:14,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-09 22:48:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938179642] [2025-01-09 22:48:14,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:14,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:48:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:14,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:48:14,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:48:14,345 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-01-09 22:48:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:14,560 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-01-09 22:48:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:48:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-01-09 22:48:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:14,561 INFO L225 Difference]: With dead ends: 61 [2025-01-09 22:48:14,561 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 22:48:14,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:48:14,564 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:14,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 22:48:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2025-01-09 22:48:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1875) internal successors, (57), 53 states have internal predecessors, (57), 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-01-09 22:48:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-01-09 22:48:14,570 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 18 [2025-01-09 22:48:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-01-09 22:48:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-01-09 22:48:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-01-09 22:48:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:48:14,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:14,571 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:14,580 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-01-09 22:48:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:14,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1855648054, now seen corresponding path program 1 times [2025-01-09 22:48:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869230879] [2025-01-09 22:48:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:48:14,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:48:14,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:14,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869230879] [2025-01-09 22:48:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869230879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250619195] [2025-01-09 22:48:15,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:15,080 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-01-09 22:48:15,083 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-01-09 22:48:15,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:48:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:48:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:15,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:48:15,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:15,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250619195] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:15,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 22:48:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523170450] [2025-01-09 22:48:15,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:48:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:15,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:48:15,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:48:15,469 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 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-01-09 22:48:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:15,573 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2025-01-09 22:48:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:48:15,576 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 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-01-09 22:48:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:15,576 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:48:15,576 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:48:15,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:48:15,577 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:15,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:48:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:48:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 89 states have internal predecessors, (93), 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-01-09 22:48:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2025-01-09 22:48:15,585 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 36 [2025-01-09 22:48:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:15,586 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2025-01-09 22:48:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 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-01-09 22:48:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2025-01-09 22:48:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 22:48:15,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:15,591 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:15,597 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-01-09 22:48:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:15,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:15,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1392485770, now seen corresponding path program 2 times [2025-01-09 22:48:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043596297] [2025-01-09 22:48:15,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:48:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:15,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-09 22:48:15,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 72 statements. [2025-01-09 22:48:15,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:48:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:48:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043596297] [2025-01-09 22:48:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043596297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:15,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859093533] [2025-01-09 22:48:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:15,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:15,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:15,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:15,854 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-01-09 22:48:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:15,906 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2025-01-09 22:48:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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 72 [2025-01-09 22:48:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:15,907 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:48:15,907 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:48:15,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:15,908 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:15,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 33 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:48:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2025-01-09 22:48:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 99 states have internal predecessors, (106), 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-01-09 22:48:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2025-01-09 22:48:15,914 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 72 [2025-01-09 22:48:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2025-01-09 22:48:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-01-09 22:48:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2025-01-09 22:48:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 22:48:15,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:15,918 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:48:15,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1850782322, now seen corresponding path program 1 times [2025-01-09 22:48:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503372104] [2025-01-09 22:48:15,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:15,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 22:48:15,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 22:48:15,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:15,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:48:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503372104] [2025-01-09 22:48:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503372104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:16,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589153756] [2025-01-09 22:48:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:16,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:16,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:16,040 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-01-09 22:48:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:16,047 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-01-09 22:48:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 74 [2025-01-09 22:48:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:16,049 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:48:16,049 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:48:16,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:16,049 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:16,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:48:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:48:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.105263157894737) internal successors, (105), 98 states have internal predecessors, (105), 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-01-09 22:48:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-01-09 22:48:16,061 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 74 [2025-01-09 22:48:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-01-09 22:48:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-01-09 22:48:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-01-09 22:48:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 22:48:16,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:16,062 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:48:16,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -485348143, now seen corresponding path program 1 times [2025-01-09 22:48:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60787731] [2025-01-09 22:48:16,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:16,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 22:48:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 22:48:16,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:16,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:48:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60787731] [2025-01-09 22:48:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60787731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:16,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:16,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:48:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54777362] [2025-01-09 22:48:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:16,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:48:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:16,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:48:16,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:16,331 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 22:48:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:16,374 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-01-09 22:48:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 76 [2025-01-09 22:48:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:16,375 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:48:16,375 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:48:16,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:48:16,376 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:16,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:48:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:48:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 98 states have internal predecessors, (104), 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-01-09 22:48:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-01-09 22:48:16,387 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 76 [2025-01-09 22:48:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:16,387 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-01-09 22:48:16,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 22:48:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-01-09 22:48:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 22:48:16,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:16,388 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:16,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:48:16,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:16,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2135696244, now seen corresponding path program 1 times [2025-01-09 22:48:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958107814] [2025-01-09 22:48:16,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 22:48:16,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 22:48:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:16,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958107814] [2025-01-09 22:48:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958107814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27085358] [2025-01-09 22:48:17,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:17,071 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-01-09 22:48:17,074 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-01-09 22:48:17,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 22:48:17,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 22:48:17,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:17,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:48:17,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:17,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27085358] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:18,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-01-09 22:48:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070053648] [2025-01-09 22:48:18,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 22:48:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:18,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 22:48:18,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 22:48:18,125 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 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-01-09 22:48:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:18,324 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2025-01-09 22:48:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 22:48:18,325 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 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 78 [2025-01-09 22:48:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:18,326 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:48:18,326 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:48:18,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 22:48:18,328 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:18,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 134 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:48:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:48:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-09 22:48:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.0538922155688624) internal successors, (176), 170 states have internal predecessors, (176), 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-01-09 22:48:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 176 transitions. [2025-01-09 22:48:18,335 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 176 transitions. Word has length 78 [2025-01-09 22:48:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:18,336 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 176 transitions. [2025-01-09 22:48:18,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 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-01-09 22:48:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2025-01-09 22:48:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 22:48:18,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:18,338 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:18,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:48:18,538 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-01-09 22:48:18,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1471418612, now seen corresponding path program 2 times [2025-01-09 22:48:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801471084] [2025-01-09 22:48:18,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:48:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:18,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-01-09 22:48:18,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 150 statements. [2025-01-09 22:48:18,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:48:18,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2025-01-09 22:48:18,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801471084] [2025-01-09 22:48:18,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801471084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:18,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:18,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189677624] [2025-01-09 22:48:18,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:18,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:18,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:18,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:18,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:18,611 INFO L87 Difference]: Start difference. First operand 171 states and 176 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-01-09 22:48:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:18,628 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2025-01-09 22:48:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:48:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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) Word has length 150 [2025-01-09 22:48:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:18,629 INFO L225 Difference]: With dead ends: 170 [2025-01-09 22:48:18,629 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 22:48:18,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:18,630 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:18,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 22:48:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-09 22:48:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.0429447852760736) internal successors, (170), 165 states have internal predecessors, (170), 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-01-09 22:48:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2025-01-09 22:48:18,642 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 150 [2025-01-09 22:48:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:18,642 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2025-01-09 22:48:18,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-01-09 22:48:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2025-01-09 22:48:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 22:48:18,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:18,645 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:18,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:48:18,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1706044350, now seen corresponding path program 1 times [2025-01-09 22:48:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935583837] [2025-01-09 22:48:18,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:18,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 22:48:18,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 22:48:18,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:18,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935583837] [2025-01-09 22:48:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935583837] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339309610] [2025-01-09 22:48:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:20,806 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-01-09 22:48:20,808 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-01-09 22:48:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 22:48:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 22:48:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:20,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:48:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:21,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339309610] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:23,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-01-09 22:48:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465725004] [2025-01-09 22:48:23,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-01-09 22:48:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:23,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-01-09 22:48:23,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 22:48:23,697 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand has 97 states, 97 states have (on average 3.020618556701031) internal successors, (293), 97 states have internal predecessors, (293), 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-01-09 22:48:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:24,150 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2025-01-09 22:48:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-09 22:48:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.020618556701031) internal successors, (293), 97 states have internal predecessors, (293), 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 151 [2025-01-09 22:48:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:24,152 INFO L225 Difference]: With dead ends: 310 [2025-01-09 22:48:24,152 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 22:48:24,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 22:48:24,155 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:24,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 22:48:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-01-09 22:48:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 307 states have (on average 1.022801302931596) internal successors, (314), 309 states have internal predecessors, (314), 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-01-09 22:48:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 314 transitions. [2025-01-09 22:48:24,162 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 314 transitions. Word has length 151 [2025-01-09 22:48:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:24,163 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 314 transitions. [2025-01-09 22:48:24,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.020618556701031) internal successors, (293), 97 states have internal predecessors, (293), 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-01-09 22:48:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 314 transitions. [2025-01-09 22:48:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 22:48:24,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:24,170 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:24,180 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-01-09 22:48:24,371 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,SelfDestructingSolverStorable10 [2025-01-09 22:48:24,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:24,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -671098558, now seen corresponding path program 2 times [2025-01-09 22:48:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620207251] [2025-01-09 22:48:24,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:48:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:24,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-01-09 22:48:24,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 22:48:24,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:48:24,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620207251] [2025-01-09 22:48:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620207251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9696640] [2025-01-09 22:48:30,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:48:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:30,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:48:30,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:48:30,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-01-09 22:48:30,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 22:48:30,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:48:30,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 22:48:30,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:31,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:48:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9696640] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:39,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-01-09 22:48:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888050951] [2025-01-09 22:48:39,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-01-09 22:48:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:39,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-01-09 22:48:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-01-09 22:48:39,877 INFO L87 Difference]: Start difference. First operand 310 states and 314 transitions. Second operand has 193 states, 193 states have (on average 3.010362694300518) internal successors, (581), 193 states have internal predecessors, (581), 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-01-09 22:48:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:40,935 INFO L93 Difference]: Finished difference Result 598 states and 602 transitions. [2025-01-09 22:48:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-09 22:48:40,936 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.010362694300518) internal successors, (581), 193 states have internal predecessors, (581), 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 295 [2025-01-09 22:48:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:40,939 INFO L225 Difference]: With dead ends: 598 [2025-01-09 22:48:40,940 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 22:48:40,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-01-09 22:48:40,943 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:40,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:48:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 22:48:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-01-09 22:48:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 595 states have (on average 1.011764705882353) internal successors, (602), 597 states have internal predecessors, (602), 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-01-09 22:48:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 602 transitions. [2025-01-09 22:48:40,953 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 602 transitions. Word has length 295 [2025-01-09 22:48:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:40,954 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 602 transitions. [2025-01-09 22:48:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.010362694300518) internal successors, (581), 193 states have internal predecessors, (581), 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-01-09 22:48:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 602 transitions. [2025-01-09 22:48:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-01-09 22:48:40,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:40,973 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:40,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:48:41,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:48:41,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 192013122, now seen corresponding path program 3 times [2025-01-09 22:48:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:41,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718922467] [2025-01-09 22:48:41,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:48:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:41,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 583 statements into 191 equivalence classes. [2025-01-09 22:48:41,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 583 statements. [2025-01-09 22:48:41,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:48:41,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-01-09 22:48:41,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718922467] [2025-01-09 22:48:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718922467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134475230] [2025-01-09 22:48:41,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:48:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:41,381 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:48:41,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:48:41,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 583 statements into 191 equivalence classes. [2025-01-09 22:48:41,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 583 statements. [2025-01-09 22:48:41,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:48:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:41,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:48:41,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:41,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:48:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-01-09 22:48:43,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-01-09 22:48:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134475230] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:45,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-01-09 22:48:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89377725] [2025-01-09 22:48:45,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:48:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:45,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:48:45,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:48:45,239 INFO L87 Difference]: Start difference. First operand 598 states and 602 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 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-01-09 22:48:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:45,547 INFO L93 Difference]: Finished difference Result 640 states and 653 transitions. [2025-01-09 22:48:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:48:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 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 583 [2025-01-09 22:48:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:45,550 INFO L225 Difference]: With dead ends: 640 [2025-01-09 22:48:45,550 INFO L226 Difference]: Without dead ends: 640 [2025-01-09 22:48:45,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:48:45,551 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 195 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:45,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 102 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-01-09 22:48:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 621. [2025-01-09 22:48:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.0161290322580645) internal successors, (630), 620 states have internal predecessors, (630), 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-01-09 22:48:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 630 transitions. [2025-01-09 22:48:45,561 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 630 transitions. Word has length 583 [2025-01-09 22:48:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:45,562 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 630 transitions. [2025-01-09 22:48:45,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 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-01-09 22:48:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 630 transitions. [2025-01-09 22:48:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 22:48:45,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:45,577 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:45,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:48:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:45,778 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash 615384685, now seen corresponding path program 1 times [2025-01-09 22:48:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967923227] [2025-01-09 22:48:45,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 22:48:45,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 22:48:45,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:45,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 54094 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 54070 trivial. 0 not checked. [2025-01-09 22:48:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967923227] [2025-01-09 22:48:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967923227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101457771] [2025-01-09 22:48:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:46,217 INFO L87 Difference]: Start difference. First operand 621 states and 630 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 22:48:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:46,226 INFO L93 Difference]: Finished difference Result 624 states and 630 transitions. [2025-01-09 22:48:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 598 [2025-01-09 22:48:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:46,230 INFO L225 Difference]: With dead ends: 624 [2025-01-09 22:48:46,230 INFO L226 Difference]: Without dead ends: 621 [2025-01-09 22:48:46,230 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-01-09 22:48:46,231 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:46,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-01-09 22:48:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2025-01-09 22:48:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.0096774193548388) internal successors, (626), 620 states have internal predecessors, (626), 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-01-09 22:48:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 626 transitions. [2025-01-09 22:48:46,244 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 626 transitions. Word has length 598 [2025-01-09 22:48:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:46,245 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 626 transitions. [2025-01-09 22:48:46,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 22:48:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 626 transitions. [2025-01-09 22:48:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-01-09 22:48:46,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:46,253 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-09 22:48:46,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:48:46,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-01-09 22:48:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1415620106, now seen corresponding path program 4 times [2025-01-09 22:48:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649031031] [2025-01-09 22:48:46,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:48:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:46,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 604 statements into 2 equivalence classes. [2025-01-09 22:48:46,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 22:48:46,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 22:48:46,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:49:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 54109 backedges. 0 proven. 54102 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:49:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:49:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649031031] [2025-01-09 22:49:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649031031] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:49:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974535000] [2025-01-09 22:49:13,156 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:49:13,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:49:13,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:49:13,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:49:13,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:49:13,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 604 statements into 2 equivalence classes.