./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:11:58,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:11:58,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:11:58,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:11:58,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:11:58,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:11:58,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:11:58,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:11:58,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:11:58,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:11:58,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:11:58,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:11:58,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:11:58,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:11:58,999 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:11:58,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:11:59,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:11:59,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:11:59,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:11:59,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:11:59,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2025-02-08 06:11:59,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:11:59,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:11:59,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:11:59,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:11:59,237 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:11:59,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-02-08 06:12:00,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59bbfb3d3/2df2f0606dd74c3985e494a04eddad65/FLAG8618fbdf8 [2025-02-08 06:12:00,586 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:12:00,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-02-08 06:12:00,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59bbfb3d3/2df2f0606dd74c3985e494a04eddad65/FLAG8618fbdf8 [2025-02-08 06:12:00,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59bbfb3d3/2df2f0606dd74c3985e494a04eddad65 [2025-02-08 06:12:00,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:12:00,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:12:00,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:12:00,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:12:00,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:12:00,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:12:00" (1/1) ... [2025-02-08 06:12:00,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c76a224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:00, skipping insertion in model container [2025-02-08 06:12:00,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:12:00" (1/1) ... [2025-02-08 06:12:00,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:12:01,033 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:12:01,033 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:12:01,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:12:01,042 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:12:01,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:12:01,085 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:12:01,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01 WrapperNode [2025-02-08 06:12:01,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:12:01,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:12:01,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:12:01,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:12:01,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,108 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2025-02-08 06:12:01,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:12:01,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:12:01,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:12:01,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:12:01,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,123 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-08 06:12:01,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:12:01,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:12:01,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:12:01,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:12:01,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (1/1) ... [2025-02-08 06:12:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:12:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:01,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:12:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:12:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:12:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:12:01,262 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:12:01,263 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:12:01,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-08 06:12:01,426 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-02-08 06:12:01,426 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:12:01,433 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:12:01,433 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:12:01,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:12:01 BoogieIcfgContainer [2025-02-08 06:12:01,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:12:01,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:12:01,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:12:01,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:12:01,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:12:00" (1/3) ... [2025-02-08 06:12:01,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d314eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:12:01, skipping insertion in model container [2025-02-08 06:12:01,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:01" (2/3) ... [2025-02-08 06:12:01,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d314eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:12:01, skipping insertion in model container [2025-02-08 06:12:01,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:12:01" (3/3) ... [2025-02-08 06:12:01,440 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2025-02-08 06:12:01,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:12:01,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrpbrk-alloca-2.i that has 1 procedures, 51 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-08 06:12:01,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:12:01,484 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;@5370288c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:12:01,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 06:12:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:01,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:01,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:01,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1456926724, now seen corresponding path program 1 times [2025-02-08 06:12:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251289202] [2025-02-08 06:12:01,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:01,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:01,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:01,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:01,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251289202] [2025-02-08 06:12:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251289202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253686222] [2025-02-08 06:12:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:01,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:01,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:01,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:01,665 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 states have internal predecessors, (59), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:01,698 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-08 06:12:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-02-08 06:12:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:01,703 INFO L225 Difference]: With dead ends: 61 [2025-02-08 06:12:01,703 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:12:01,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:01,706 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:01,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:12:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-08 06:12:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.8125) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-08 06:12:01,726 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 6 [2025-02-08 06:12:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-08 06:12:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-08 06:12:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:01,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:01,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:01,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:12:01,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:01,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003203, now seen corresponding path program 1 times [2025-02-08 06:12:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921342895] [2025-02-08 06:12:01,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:01,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:01,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:01,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921342895] [2025-02-08 06:12:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921342895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:12:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899163080] [2025-02-08 06:12:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:12:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:12:01,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:01,830 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:01,871 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-02-08 06:12:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:12:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 06:12:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:01,872 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:12:01,872 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:12:01,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:01,873 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:01,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:12:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:12:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.75) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-08 06:12:01,876 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 6 [2025-02-08 06:12:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-08 06:12:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-08 06:12:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:01,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:01,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:01,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:12:01,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:01,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003202, now seen corresponding path program 1 times [2025-02-08 06:12:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903616652] [2025-02-08 06:12:01,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:01,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:01,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:01,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:01,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903616652] [2025-02-08 06:12:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903616652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851965800] [2025-02-08 06:12:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:02,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:02,060 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,159 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-02-08 06:12:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-02-08 06:12:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,160 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:12:02,161 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:12:02,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-02-08 06:12:02,162 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:12:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 06:12:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:12:02,169 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 6 [2025-02-08 06:12:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,169 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:12:02,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:12:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:02,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:12:02,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906776, now seen corresponding path program 1 times [2025-02-08 06:12:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359041287] [2025-02-08 06:12:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:02,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:02,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359041287] [2025-02-08 06:12:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359041287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910153942] [2025-02-08 06:12:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:02,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:02,328 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,374 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-02-08 06:12:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:12:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,376 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:12:02,376 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:12:02,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:02,378 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:12:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-02-08 06:12:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.736842105263158) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-08 06:12:02,380 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 7 [2025-02-08 06:12:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,380 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-08 06:12:02,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-08 06:12:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:02,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:12:02,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906935, now seen corresponding path program 1 times [2025-02-08 06:12:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577858980] [2025-02-08 06:12:02,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:02,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:02,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577858980] [2025-02-08 06:12:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577858980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971968429] [2025-02-08 06:12:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:02,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:02,431 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,457 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-02-08 06:12:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:12:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,457 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:12:02,458 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:12:02,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:02,458 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:12:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-08 06:12:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 64 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-08 06:12:02,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 7 [2025-02-08 06:12:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,462 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 06:12:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-08 06:12:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:02,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:12:02,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830456, now seen corresponding path program 1 times [2025-02-08 06:12:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032457964] [2025-02-08 06:12:02,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:02,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:02,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032457964] [2025-02-08 06:12:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032457964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:02,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675066763] [2025-02-08 06:12:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:02,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:02,611 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,667 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-08 06:12:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:12:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,667 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:12:02,667 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:12:02,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:02,668 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:12:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-02-08 06:12:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-02-08 06:12:02,671 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 7 [2025-02-08 06:12:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-02-08 06:12:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-02-08 06:12:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:02,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:12:02,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830457, now seen corresponding path program 1 times [2025-02-08 06:12:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943101428] [2025-02-08 06:12:02,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943101428] [2025-02-08 06:12:02,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943101428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:02,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000083164] [2025-02-08 06:12:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:02,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:02,763 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,824 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-02-08 06:12:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:12:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:12:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,825 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:02,825 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:02,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:02,826 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-02-08 06:12:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:12:02,829 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:12:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:12:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:12:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:02,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:12:02,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2108535927, now seen corresponding path program 1 times [2025-02-08 06:12:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906954547] [2025-02-08 06:12:02,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:02,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:02,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906954547] [2025-02-08 06:12:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906954547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:02,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796910254] [2025-02-08 06:12:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:02,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:02,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:02,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:02,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:02,935 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,963 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-02-08 06:12:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:02,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:12:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,963 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:12:02,963 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:12:02,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:02,964 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:12:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-02-08 06:12:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:12:02,967 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:12:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:12:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:12:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:12:02,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:12:02,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 52600599, now seen corresponding path program 1 times [2025-02-08 06:12:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071022303] [2025-02-08 06:12:02,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:12:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:12:02,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:02,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071022303] [2025-02-08 06:12:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071022303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:03,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714658808] [2025-02-08 06:12:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:03,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:03,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:03,041 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:03,058 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-02-08 06:12:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-02-08 06:12:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:03,058 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:12:03,058 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:12:03,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:03,059 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:03,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:12:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-08 06:12:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-02-08 06:12:03,062 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 8 [2025-02-08 06:12:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-02-08 06:12:03,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-02-08 06:12:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:12:03,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:03,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:03,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:12:03,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:03,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash 81229750, now seen corresponding path program 1 times [2025-02-08 06:12:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980472999] [2025-02-08 06:12:03,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:03,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:12:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:12:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980472999] [2025-02-08 06:12:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980472999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833608342] [2025-02-08 06:12:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:03,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:03,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:03,144 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:03,175 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:12:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-02-08 06:12:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:03,176 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:03,176 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:03,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:03,177 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:03,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-08 06:12:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2025-02-08 06:12:03,179 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 8 [2025-02-08 06:12:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:03,179 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2025-02-08 06:12:03,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2025-02-08 06:12:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:12:03,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:03,180 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:12:03,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -916672325, now seen corresponding path program 1 times [2025-02-08 06:12:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051455389] [2025-02-08 06:12:03,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:03,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:12:03,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:12:03,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:03,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051455389] [2025-02-08 06:12:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051455389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324628773] [2025-02-08 06:12:03,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:03,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:12:03,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:12:03,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:12:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:12:03,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:03,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:12:03,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:12:03,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 06:12:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:03,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:03,946 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:12:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:03,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324628773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:03,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:03,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-02-08 06:12:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407396660] [2025-02-08 06:12:03,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:03,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:12:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:03,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:12:03,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:12:03,966 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:04,157 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:12:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:12:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:04,158 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:04,158 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:04,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:04,159 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:04,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-02-08 06:12:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.54) internal successors, (77), 62 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-02-08 06:12:04,161 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 9 [2025-02-08 06:12:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-02-08 06:12:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-02-08 06:12:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:12:04,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:04,162 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:04,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:04,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:12:04,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:04,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 757151514, now seen corresponding path program 1 times [2025-02-08 06:12:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678426183] [2025-02-08 06:12:04,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:04,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:04,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:04,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:04,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678426183] [2025-02-08 06:12:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678426183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056687016] [2025-02-08 06:12:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:04,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:04,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:12:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:04,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:04,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:04,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:04,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:12:04,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:04,678 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 7 [2025-02-08 06:12:04,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:12:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:04,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:05,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056687016] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:05,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:05,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 06:12:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094918408] [2025-02-08 06:12:05,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:05,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:12:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:05,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:12:05,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:12:05,049 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:05,228 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-02-08 06:12:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 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 10 [2025-02-08 06:12:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:05,229 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:12:05,229 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:12:05,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:12:05,229 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:05,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 262 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:12:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-02-08 06:12:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.5) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-02-08 06:12:05,235 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 10 [2025-02-08 06:12:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:05,235 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-02-08 06:12:05,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-02-08 06:12:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:12:05,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:05,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:05,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:05,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:05,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:05,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1647923930, now seen corresponding path program 1 times [2025-02-08 06:12:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:05,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784179567] [2025-02-08 06:12:05,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:05,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:05,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784179567] [2025-02-08 06:12:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784179567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418169080] [2025-02-08 06:12:05,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:05,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:05,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:12:05,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:05,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:05,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:05,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:05,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:12:05,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:05,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:12:05,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:12:05,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 06:12:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:05,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:06,079 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:12:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418169080] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:06,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:12:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 14 [2025-02-08 06:12:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077560752] [2025-02-08 06:12:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:12:06,130 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,314 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-08 06:12:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:12:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-02-08 06:12:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,315 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:12:06,315 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:12:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:06,315 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:12:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-02-08 06:12:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-08 06:12:06,318 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 10 [2025-02-08 06:12:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,318 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-08 06:12:06,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-08 06:12:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:12:06,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:12:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:06,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash -638636173, now seen corresponding path program 1 times [2025-02-08 06:12:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193580437] [2025-02-08 06:12:06,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:12:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:12:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193580437] [2025-02-08 06:12:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193580437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329008351] [2025-02-08 06:12:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:06,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:06,557 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,582 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-02-08 06:12:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 11 [2025-02-08 06:12:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,583 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:12:06,583 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:12:06,583 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-02-08 06:12:06,583 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:12:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 06:12:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-08 06:12:06,585 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 11 [2025-02-08 06:12:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,585 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-08 06:12:06,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-08 06:12:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:12:06,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:12:06,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash -638636172, now seen corresponding path program 1 times [2025-02-08 06:12:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222431984] [2025-02-08 06:12:06,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:12:06,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:12:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222431984] [2025-02-08 06:12:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222431984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:12:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317600898] [2025-02-08 06:12:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:06,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:06,655 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,710 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-02-08 06:12:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:12:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 11 [2025-02-08 06:12:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,710 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:12:06,710 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 06:12:06,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:06,711 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 06:12:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2025-02-08 06:12:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-08 06:12:06,713 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-02-08 06:12:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,713 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-08 06:12:06,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-08 06:12:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:12:06,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:12:06,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1094895406, now seen corresponding path program 1 times [2025-02-08 06:12:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217935971] [2025-02-08 06:12:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:12:06,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:12:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217935971] [2025-02-08 06:12:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217935971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:06,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:12:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020378950] [2025-02-08 06:12:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:06,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:06,821 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,848 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-08 06:12:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-08 06:12:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,851 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:12:06,851 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:12:06,851 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-02-08 06:12:06,851 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:12:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:12:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 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-02-08 06:12:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-08 06:12:06,852 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 14 [2025-02-08 06:12:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-08 06:12:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-02-08 06:12:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:12:06,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:12:06,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -70776497, now seen corresponding path program 1 times [2025-02-08 06:12:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310057114] [2025-02-08 06:12:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:12:06,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:12:06,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:06,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310057114] [2025-02-08 06:12:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310057114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764761530] [2025-02-08 06:12:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:06,888 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,917 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-02-08 06:12:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-02-08 06:12:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,917 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:12:06,918 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:12:06,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:06,918 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:12:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:12:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) 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-02-08 06:12:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-02-08 06:12:06,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-02-08 06:12:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,920 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-08 06:12:06,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-02-08 06:12:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:12:06,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:12:06,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash -70776496, now seen corresponding path program 1 times [2025-02-08 06:12:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714527294] [2025-02-08 06:12:06,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:12:06,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:12:06,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:06,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714527294] [2025-02-08 06:12:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714527294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:12:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895005897] [2025-02-08 06:12:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:12:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:12:07,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:07,021 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,100 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-02-08 06:12:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:07,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2025-02-08 06:12:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,101 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:12:07,101 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:12:07,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:07,101 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:12:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-08 06:12:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-08 06:12:07,102 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 16 [2025-02-08 06:12:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-08 06:12:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-08 06:12:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:12:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,103 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:12:07,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 54391714, now seen corresponding path program 1 times [2025-02-08 06:12:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075587471] [2025-02-08 06:12:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:12:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:12:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075587471] [2025-02-08 06:12:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075587471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919580606] [2025-02-08 06:12:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:12:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:12:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:07,121 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,127 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-02-08 06:12:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:12:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:12:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,127 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:12:07,127 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:12:07,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:07,128 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:12:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:12:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-02-08 06:12:07,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2025-02-08 06:12:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,129 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-02-08 06:12:07,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-02-08 06:12:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:12:07,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,130 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:12:07,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 703740836, now seen corresponding path program 1 times [2025-02-08 06:12:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501332739] [2025-02-08 06:12:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:12:07,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:12:07,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:12:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501332739] [2025-02-08 06:12:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501332739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:12:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313797298] [2025-02-08 06:12:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:12:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:12:07,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:07,242 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-02-08 06:12:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,275 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-02-08 06:12:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:12:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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 23 [2025-02-08 06:12:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,276 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:12:07,276 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:12:07,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:12:07,276 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:12:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:12:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:12:07,277 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 23 [2025-02-08 06:12:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,278 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:12:07,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-02-08 06:12:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:12:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:12:07,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,278 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:12:07,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1334315453, now seen corresponding path program 1 times [2025-02-08 06:12:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900811234] [2025-02-08 06:12:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:12:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:12:07,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:12:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900811234] [2025-02-08 06:12:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900811234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:12:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315891742] [2025-02-08 06:12:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:12:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:12:07,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:12:07,425 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-02-08 06:12:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,468 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 06:12:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 23 [2025-02-08 06:12:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,469 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:12:07,469 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:12:07,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:07,469 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:12:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-02-08 06:12:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-08 06:12:07,471 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2025-02-08 06:12:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,471 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-08 06:12:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-02-08 06:12:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-08 06:12:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:07,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,472 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:12:07,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 666398374, now seen corresponding path program 1 times [2025-02-08 06:12:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084147925] [2025-02-08 06:12:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:07,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:07,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084147925] [2025-02-08 06:12:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084147925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:12:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908744556] [2025-02-08 06:12:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:12:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:12:07,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:07,634 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,702 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-02-08 06:12:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2025-02-08 06:12:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,706 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:12:07,706 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:12:07,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:12:07,707 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:12:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-08 06:12:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-02-08 06:12:07,708 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 26 [2025-02-08 06:12:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-02-08 06:12:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-02-08 06:12:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:07,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:12:07,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 692042114, now seen corresponding path program 1 times [2025-02-08 06:12:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983802381] [2025-02-08 06:12:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:07,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:07,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983802381] [2025-02-08 06:12:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983802381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:12:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266409275] [2025-02-08 06:12:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:12:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:12:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:12:07,790 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,883 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2025-02-08 06:12:07,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2025-02-08 06:12:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,884 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:12:07,884 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 06:12:07,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:12:07,885 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 165 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 06:12:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 06:12:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-08 06:12:07,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2025-02-08 06:12:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-08 06:12:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-08 06:12:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:07,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,887 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:12:07,887 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 599391621, now seen corresponding path program 1 times [2025-02-08 06:12:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356171359] [2025-02-08 06:12:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:07,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:07,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:07,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356171359] [2025-02-08 06:12:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356171359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789788625] [2025-02-08 06:12:08,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:08,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:08,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:12:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:08,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:08,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:08,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:12:08,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:08,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:12:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:08,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:12:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789788625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:12:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 06:12:08,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066490687] [2025-02-08 06:12:08,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:08,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:12:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:08,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:12:08,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:08,319 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:08,407 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-02-08 06:12:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:12:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2025-02-08 06:12:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:08,407 INFO L225 Difference]: With dead ends: 62 [2025-02-08 06:12:08,407 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 06:12:08,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:12:08,408 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:08,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 187 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 06:12:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-08 06:12:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-08 06:12:08,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 26 [2025-02-08 06:12:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-08 06:12:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-08 06:12:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:12:08,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:08,410 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:08,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:08,610 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,SelfDestructingSolverStorable23 [2025-02-08 06:12:08,610 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:08,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2019661338, now seen corresponding path program 1 times [2025-02-08 06:12:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355150704] [2025-02-08 06:12:08,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:12:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:12:08,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:08,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355150704] [2025-02-08 06:12:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355150704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895856452] [2025-02-08 06:12:08,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:08,876 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:08,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:12:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:12:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:12:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 06:12:08,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:09,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:12:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895856452] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:09,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-02-08 06:12:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607059639] [2025-02-08 06:12:09,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:12:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:09,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:12:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:12:09,173 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:09,314 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-02-08 06:12:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:12:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 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 29 [2025-02-08 06:12:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:09,315 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:12:09,315 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:12:09,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:12:09,316 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 137 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:09,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 161 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:12:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-02-08 06:12:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-08 06:12:09,317 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2025-02-08 06:12:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:09,317 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-08 06:12:09,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-08 06:12:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:12:09,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:09,318 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:09,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:09,522 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,SelfDestructingSolverStorable24 [2025-02-08 06:12:09,522 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash 429226948, now seen corresponding path program 1 times [2025-02-08 06:12:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623004164] [2025-02-08 06:12:09,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:12:09,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:12:09,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623004164] [2025-02-08 06:12:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623004164] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111287153] [2025-02-08 06:12:09,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:09,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:09,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:12:09,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:12:09,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:12:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:09,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:12:09,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:09,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:12:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111287153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:09,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 06:12:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596586690] [2025-02-08 06:12:09,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:12:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:09,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:12:09,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:12:09,955 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:10,054 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-02-08 06:12:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 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 31 [2025-02-08 06:12:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:10,055 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:12:10,055 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:12:10,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:10,055 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:10,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 200 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:12:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2025-02-08 06:12:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 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-02-08 06:12:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-02-08 06:12:10,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 31 [2025-02-08 06:12:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:10,057 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-02-08 06:12:10,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-02-08 06:12:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:12:10,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:10,057 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:10,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:12:10,259 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,SelfDestructingSolverStorable25 [2025-02-08 06:12:10,260 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 270542414, now seen corresponding path program 2 times [2025-02-08 06:12:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257137501] [2025-02-08 06:12:10,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:10,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:12:10,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:12:10,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:10,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257137501] [2025-02-08 06:12:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257137501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438596411] [2025-02-08 06:12:10,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:10,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:10,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:12:10,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:12:10,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:12:10,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:10,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:10,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:12:10,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:10,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:12:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:10,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:10,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438596411] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:10,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2025-02-08 06:12:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472051205] [2025-02-08 06:12:10,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:10,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:12:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:10,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:12:10,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:12:10,761 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:10,949 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-02-08 06:12:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:12:10,949 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 06:12:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:10,949 INFO L225 Difference]: With dead ends: 112 [2025-02-08 06:12:10,949 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:12:10,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:12:10,950 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:10,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 352 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:12:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-02-08 06:12:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-02-08 06:12:10,954 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 36 [2025-02-08 06:12:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:10,954 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-02-08 06:12:10,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-02-08 06:12:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:12:10,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:10,955 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:10,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:11,156 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -854241937, now seen corresponding path program 3 times [2025-02-08 06:12:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517165169] [2025-02-08 06:12:11,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:11,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:12:11,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:12:11,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:11,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517165169] [2025-02-08 06:12:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517165169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251506785] [2025-02-08 06:12:11,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:11,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:11,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:11,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:12:11,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:12:11,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:12:11,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:11,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:12:11,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:11,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:11,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 06:12:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251506785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:12,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-02-08 06:12:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494998071] [2025-02-08 06:12:12,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:12,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:12:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:12,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:12:12,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:12:12,007 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:12,234 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-02-08 06:12:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:12:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 06:12:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:12,238 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:12:12,238 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:12:12,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:12:12,241 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 76 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:12,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 331 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:12:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2025-02-08 06:12:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.1150442477876106) internal successors, (126), 114 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2025-02-08 06:12:12,245 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 39 [2025-02-08 06:12:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:12,245 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2025-02-08 06:12:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2025-02-08 06:12:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:12:12,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:12,245 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:12,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:12:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:12:12,447 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:12,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1820436910, now seen corresponding path program 2 times [2025-02-08 06:12:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163337796] [2025-02-08 06:12:12,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:12,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:12:12,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:12:12,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:12,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163337796] [2025-02-08 06:12:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163337796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184007690] [2025-02-08 06:12:13,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:13,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:13,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:13,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:12:13,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:12:13,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:12:13,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:13,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:13,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 06:12:13,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:13,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:12:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:13,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 06:12:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184007690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:13,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 12] total 29 [2025-02-08 06:12:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241378487] [2025-02-08 06:12:13,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:12:13,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:12:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:12:13,541 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:13,771 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2025-02-08 06:12:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:12:13,772 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 29 states have internal predecessors, (94), 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 45 [2025-02-08 06:12:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:13,772 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:12:13,772 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:12:13,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:12:13,778 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 79 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 356 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:12:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-02-08 06:12:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.103896103896104) internal successors, (170), 155 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-02-08 06:12:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-02-08 06:12:13,781 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 45 [2025-02-08 06:12:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:13,781 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-02-08 06:12:13,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-02-08 06:12:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:12:13,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:13,781 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:13,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:12:13,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:12:13,988 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 473228965, now seen corresponding path program 4 times [2025-02-08 06:12:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949779548] [2025-02-08 06:12:13,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:13,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:14,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:14,038 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949779548] [2025-02-08 06:12:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949779548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019198958] [2025-02-08 06:12:14,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:14,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:14,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:12:14,783 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:14,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:14,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:14,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:14,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:12:14,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:14,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-08 06:12:15,569 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-02-08 06:12:15,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-02-08 06:12:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:15,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:16,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:12:16,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:16,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 06:12:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019198958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:16,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2025-02-08 06:12:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044796082] [2025-02-08 06:12:16,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-08 06:12:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:16,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-08 06:12:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2310, Unknown=0, NotChecked=0, Total=2550 [2025-02-08 06:12:16,199 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 51 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,934 INFO L93 Difference]: Finished difference Result 294 states and 315 transitions. [2025-02-08 06:12:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:12:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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 46 [2025-02-08 06:12:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,939 INFO L225 Difference]: With dead ends: 294 [2025-02-08 06:12:17,939 INFO L226 Difference]: Without dead ends: 260 [2025-02-08 06:12:17,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=593, Invalid=5413, Unknown=0, NotChecked=0, Total=6006 [2025-02-08 06:12:17,941 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 125 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 534 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:12:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-08 06:12:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 230. [2025-02-08 06:12:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 1.0964912280701755) internal successors, (250), 229 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 250 transitions. [2025-02-08 06:12:17,947 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 250 transitions. Word has length 46 [2025-02-08 06:12:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 250 transitions. [2025-02-08 06:12:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 250 transitions. [2025-02-08 06:12:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:12:17,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,948 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:12:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:18,153 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:18,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -537317037, now seen corresponding path program 3 times [2025-02-08 06:12:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537551535] [2025-02-08 06:12:18,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:18,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-02-08 06:12:18,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:12:18,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537551535] [2025-02-08 06:12:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537551535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409598587] [2025-02-08 06:12:18,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:18,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:18,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:12:18,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-02-08 06:12:18,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:12:18,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:18,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 06:12:18,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:18,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:18,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 06:12:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409598587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:18,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:18,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-08 06:12:18,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603727469] [2025-02-08 06:12:18,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:12:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:18,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:12:18,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:12:18,762 INFO L87 Difference]: Start difference. First operand 230 states and 250 transitions. Second operand has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:18,972 INFO L93 Difference]: Finished difference Result 371 states and 400 transitions. [2025-02-08 06:12:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:12:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-08 06:12:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:18,974 INFO L225 Difference]: With dead ends: 371 [2025-02-08 06:12:18,975 INFO L226 Difference]: Without dead ends: 371 [2025-02-08 06:12:18,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:12:18,975 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:18,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 490 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-08 06:12:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 302. [2025-02-08 06:12:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 300 states have (on average 1.0933333333333333) internal successors, (328), 301 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 328 transitions. [2025-02-08 06:12:18,980 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 328 transitions. Word has length 48 [2025-02-08 06:12:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 328 transitions. [2025-02-08 06:12:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 328 transitions. [2025-02-08 06:12:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:12:18,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:18,981 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:18,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:12:19,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-08 06:12:19,186 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:19,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1787657298, now seen corresponding path program 5 times [2025-02-08 06:12:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:19,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989752143] [2025-02-08 06:12:19,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:19,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:19,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:19,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 06:12:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:19,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989752143] [2025-02-08 06:12:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989752143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169102004] [2025-02-08 06:12:19,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:19,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:19,753 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:19,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:12:19,817 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:19,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:19,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 06:12:19,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:19,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 06:12:19,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:19,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:12:20,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:12:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:20,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:20,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:20,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169102004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:20,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 28 [2025-02-08 06:12:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989416689] [2025-02-08 06:12:20,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:12:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:12:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2025-02-08 06:12:20,214 INFO L87 Difference]: Start difference. First operand 302 states and 328 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:20,567 INFO L93 Difference]: Finished difference Result 453 states and 486 transitions. [2025-02-08 06:12:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:12:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 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 56 [2025-02-08 06:12:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:20,569 INFO L225 Difference]: With dead ends: 453 [2025-02-08 06:12:20,569 INFO L226 Difference]: Without dead ends: 408 [2025-02-08 06:12:20,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 06:12:20,569 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:20,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 694 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-08 06:12:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 397. [2025-02-08 06:12:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 395 states have (on average 1.0911392405063292) internal successors, (431), 396 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 431 transitions. [2025-02-08 06:12:20,580 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 431 transitions. Word has length 56 [2025-02-08 06:12:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:20,580 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 431 transitions. [2025-02-08 06:12:20,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 431 transitions. [2025-02-08 06:12:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:12:20,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:20,581 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:20,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:12:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:20,786 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 856019023, now seen corresponding path program 6 times [2025-02-08 06:12:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598378827] [2025-02-08 06:12:20,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:20,797 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 5 equivalence classes. [2025-02-08 06:12:20,810 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:20,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598378827] [2025-02-08 06:12:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598378827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375991869] [2025-02-08 06:12:21,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:21,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:21,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:21,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:21,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:12:21,212 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 5 equivalence classes. [2025-02-08 06:12:21,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:21,305 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:21,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 06:12:21,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:21,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:21,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-08 06:12:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375991869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:21,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:21,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-02-08 06:12:21,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421940552] [2025-02-08 06:12:21,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:12:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:12:21,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:12:21,890 INFO L87 Difference]: Start difference. First operand 397 states and 431 transitions. Second operand has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:22,243 INFO L93 Difference]: Finished difference Result 461 states and 500 transitions. [2025-02-08 06:12:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:12:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 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 59 [2025-02-08 06:12:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:22,245 INFO L225 Difference]: With dead ends: 461 [2025-02-08 06:12:22,245 INFO L226 Difference]: Without dead ends: 461 [2025-02-08 06:12:22,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=2028, Unknown=0, NotChecked=0, Total=2352 [2025-02-08 06:12:22,246 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 212 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:22,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 401 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-08 06:12:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2025-02-08 06:12:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 1.0921985815602837) internal successors, (462), 424 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2025-02-08 06:12:22,253 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 462 transitions. Word has length 59 [2025-02-08 06:12:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:22,253 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 462 transitions. [2025-02-08 06:12:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 462 transitions. [2025-02-08 06:12:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 06:12:22,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:22,254 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:22,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:12:22,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:22,455 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:22,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1146201505, now seen corresponding path program 4 times [2025-02-08 06:12:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496976545] [2025-02-08 06:12:22,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:22,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-02-08 06:12:22,469 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 62 statements. [2025-02-08 06:12:22,469 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496976545] [2025-02-08 06:12:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496976545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245816025] [2025-02-08 06:12:23,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:23,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:23,661 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:23,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:12:23,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-02-08 06:12:23,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 62 statements. [2025-02-08 06:12:23,748 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:23,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:23,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-08 06:12:23,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:23,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-08 06:12:25,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:25,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 135 [2025-02-08 06:12:26,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:26,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2025-02-08 06:12:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:12:26,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:27,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:27,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-08 06:12:27,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2025-02-08 06:12:27,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2025-02-08 06:12:27,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:12:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:12:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245816025] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:27,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:27,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 59 [2025-02-08 06:12:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287248513] [2025-02-08 06:12:27,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-08 06:12:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:27,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-08 06:12:27,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=3161, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 06:12:27,566 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:32,688 INFO L93 Difference]: Finished difference Result 768 states and 824 transitions. [2025-02-08 06:12:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-08 06:12:32,688 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 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 62 [2025-02-08 06:12:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:32,689 INFO L225 Difference]: With dead ends: 768 [2025-02-08 06:12:32,689 INFO L226 Difference]: Without dead ends: 373 [2025-02-08 06:12:32,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1912, Invalid=9008, Unknown=0, NotChecked=0, Total=10920 [2025-02-08 06:12:32,691 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 413 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:32,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 640 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:12:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-08 06:12:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 130. [2025-02-08 06:12:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-02-08 06:12:32,695 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 62 [2025-02-08 06:12:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:32,695 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-02-08 06:12:32,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-02-08 06:12:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:12:32,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:32,696 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:32,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:12:32,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-08 06:12:32,896 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:32,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1712678853, now seen corresponding path program 7 times [2025-02-08 06:12:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782941588] [2025-02-08 06:12:32,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:32,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:12:32,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:32,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:32,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782941588] [2025-02-08 06:12:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782941588] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297464396] [2025-02-08 06:12:33,236 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:33,239 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:33,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:12:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:12:33,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:33,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 06:12:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:12:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:33,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:33,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297464396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:33,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-02-08 06:12:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433690400] [2025-02-08 06:12:33,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 06:12:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:33,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 06:12:33,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:12:33,612 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:34,005 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2025-02-08 06:12:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:12:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 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 66 [2025-02-08 06:12:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:34,007 INFO L225 Difference]: With dead ends: 225 [2025-02-08 06:12:34,007 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:12:34,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 06:12:34,008 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:34,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 573 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:12:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-02-08 06:12:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0814814814814815) internal successors, (146), 135 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2025-02-08 06:12:34,013 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 66 [2025-02-08 06:12:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:34,013 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2025-02-08 06:12:34,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2025-02-08 06:12:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 06:12:34,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:34,014 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:34,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:34,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-08 06:12:34,215 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:34,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash -254927066, now seen corresponding path program 8 times [2025-02-08 06:12:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591534356] [2025-02-08 06:12:34,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:34,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-02-08 06:12:34,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:34,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591534356] [2025-02-08 06:12:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591534356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273195947] [2025-02-08 06:12:34,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:34,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:34,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:34,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:12:34,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-02-08 06:12:34,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:34,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:34,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:34,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-08 06:12:34,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:34,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-08 06:12:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273195947] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:35,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:35,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2025-02-08 06:12:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627883011] [2025-02-08 06:12:35,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:12:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:35,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:12:35,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:12:35,267 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:35,686 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2025-02-08 06:12:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:12:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 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 69 [2025-02-08 06:12:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:35,687 INFO L225 Difference]: With dead ends: 166 [2025-02-08 06:12:35,687 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 06:12:35,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=2124, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 06:12:35,688 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 159 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:35,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 540 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 06:12:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2025-02-08 06:12:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.080536912751678) internal successors, (161), 149 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2025-02-08 06:12:35,691 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 69 [2025-02-08 06:12:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:35,691 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2025-02-08 06:12:35,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.170731707317073) internal successors, (171), 42 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2025-02-08 06:12:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 06:12:35,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:35,691 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:35,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:12:35,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:35,896 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:35,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash -250214130, now seen corresponding path program 9 times [2025-02-08 06:12:35,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:35,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326056252] [2025-02-08 06:12:35,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:35,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:35,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 7 equivalence classes. [2025-02-08 06:12:35,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 06:12:35,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 06:12:35,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 27 proven. 125 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326056252] [2025-02-08 06:12:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326056252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657268284] [2025-02-08 06:12:36,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:36,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:36,303 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:36,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:12:36,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 7 equivalence classes. [2025-02-08 06:12:36,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 06:12:36,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 06:12:36,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-08 06:12:36,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:36,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:12:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 27 proven. 125 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:36,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:36,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 27 proven. 125 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657268284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:36,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 34 [2025-02-08 06:12:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967535635] [2025-02-08 06:12:36,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:36,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:12:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:36,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:12:36,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:12:36,774 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:37,316 INFO L93 Difference]: Finished difference Result 260 states and 276 transitions. [2025-02-08 06:12:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:12:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 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-02-08 06:12:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:37,317 INFO L225 Difference]: With dead ends: 260 [2025-02-08 06:12:37,317 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 06:12:37,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=2065, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:12:37,318 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 134 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:37,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 837 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 06:12:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-02-08 06:12:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 155 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2025-02-08 06:12:37,321 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 76 [2025-02-08 06:12:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2025-02-08 06:12:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2025-02-08 06:12:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:12:37,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:37,322 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:37,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 06:12:37,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:37,526 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:37,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1547549487, now seen corresponding path program 10 times [2025-02-08 06:12:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631360418] [2025-02-08 06:12:37,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:37,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-02-08 06:12:37,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 79 statements. [2025-02-08 06:12:37,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:37,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:39,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631360418] [2025-02-08 06:12:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631360418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849024270] [2025-02-08 06:12:39,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:39,213 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:39,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:12:39,294 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-02-08 06:12:39,325 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 79 statements. [2025-02-08 06:12:39,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-08 06:12:39,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:39,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-08 06:12:42,326 INFO L349 Elim1Store]: treesize reduction 20, result has 70.1 percent of original size [2025-02-08 06:12:42,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 73 [2025-02-08 06:12:42,340 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-08 06:12:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 80 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 06:12:42,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:44,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2025-02-08 06:12:44,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2025-02-08 06:12:44,903 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-08 06:12:44,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:12:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 06:12:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849024270] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:44,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 29] total 87 [2025-02-08 06:12:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063198272] [2025-02-08 06:12:44,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:44,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-02-08 06:12:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:44,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-02-08 06:12:44,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=6828, Unknown=0, NotChecked=0, Total=7656 [2025-02-08 06:12:44,934 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand has 88 states, 87 states have (on average 2.0689655172413794) internal successors, (180), 88 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:52,763 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2025-02-08 06:12:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-08 06:12:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 2.0689655172413794) internal successors, (180), 88 states have internal predecessors, (180), 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 79 [2025-02-08 06:12:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:52,764 INFO L225 Difference]: With dead ends: 175 [2025-02-08 06:12:52,764 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:12:52,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3371 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1974, Invalid=11366, Unknown=0, NotChecked=0, Total=13340 [2025-02-08 06:12:52,767 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:52,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 756 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 06:12:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:12:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:12:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:12:52,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-02-08 06:12:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:12:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 2.0689655172413794) internal successors, (180), 88 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:12:52,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:12:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2025-02-08 06:12:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2025-02-08 06:12:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2025-02-08 06:12:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-02-08 06:12:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-02-08 06:12:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2025-02-08 06:12:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2025-02-08 06:12:52,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 06:12:52,975 INFO L422 BasicCegarLoop]: Path program histogram: [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:52,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:12:52,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:12:52 BoogieIcfgContainer [2025-02-08 06:12:52,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:12:52,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:12:52,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:12:52,979 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:12:52,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:12:01" (3/4) ... [2025-02-08 06:12:52,982 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:12:52,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 06:12:52,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 06:12:52,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:12:52,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:12:53,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:12:53,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:12:53,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:12:53,053 INFO L158 Benchmark]: Toolchain (without parser) took 52172.65ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 65.2MB in the end (delta: 42.0MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2025-02-08 06:12:53,054 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:12:53,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.94ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 90.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:12:53,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.57ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:12:53,054 INFO L158 Benchmark]: Boogie Preprocessor took 20.66ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:12:53,055 INFO L158 Benchmark]: IcfgBuilder took 302.89ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 70.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:12:53,057 INFO L158 Benchmark]: TraceAbstraction took 51543.04ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 71.2MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:12:53,057 INFO L158 Benchmark]: Witness Printer took 73.65ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 65.2MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:12:53,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.94ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 90.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.57ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.66ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 302.89ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 70.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51543.04ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 71.2MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.65ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 65.2MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 51.5s, OverallIterations: 38, TraceHistogramMax: 7, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2226 mSDsluCounter, 9864 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8543 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11919 IncrementalHoareTripleChecker+Invalid, 12037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 1321 mSDtfsCounter, 11919 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2097 GetRequests, 1259 SyntacticMatches, 18 SemanticMatches, 820 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 11545 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=33, InterpolantAutomatonStates: 462, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 565 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 2545 ConstructedInterpolants, 114 QuantifiedInterpolants, 31772 SizeOfPredicates, 126 NumberOfNonLiveVariables, 3601 ConjunctsInSsa, 778 ConjunctsInUnsatCore, 73 InterpolantComputations, 22 PerfectInterpolantSequences, 655/2571 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:12:53,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE