./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:19:13,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:19:13,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:19:13,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:19:13,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:19:13,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:19:13,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:19:13,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:19:13,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:19:13,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:19:13,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:19:13,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:19:13,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:19:13,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:19:13,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:19:13,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:19:13,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:19:13,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:19:13,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:19:13,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:19:13,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:19:13,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:19:13,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:19:13,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:19:13,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:19:13,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:19:13,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:19:13,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:19:13,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:19:13,780 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2025-02-06 10:19:14,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:19:14,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:19:14,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:19:14,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:19:14,045 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:19:14,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2025-02-06 10:19:15,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b849047ff/689ce00dcb4d4976b7b09985f58565f7/FLAG053ada51f [2025-02-06 10:19:15,654 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:19:15,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2025-02-06 10:19:15,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b849047ff/689ce00dcb4d4976b7b09985f58565f7/FLAG053ada51f [2025-02-06 10:19:15,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b849047ff/689ce00dcb4d4976b7b09985f58565f7 [2025-02-06 10:19:15,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:19:15,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:19:15,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:15,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:19:15,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:19:15,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:15" (1/1) ... [2025-02-06 10:19:15,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ff894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:15, skipping insertion in model container [2025-02-06 10:19:15,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:15" (1/1) ... [2025-02-06 10:19:15,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:19:16,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:16,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:19:16,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:16,379 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:19:16,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16 WrapperNode [2025-02-06 10:19:16,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:16,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:16,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:19:16,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:19:16,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,433 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 215 [2025-02-06 10:19:16,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:16,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:19:16,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:19:16,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:19:16,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,479 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2025-02-06 10:19:16,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:19:16,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:19:16,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:19:16,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:19:16,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (1/1) ... [2025-02-06 10:19:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:19:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:16,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:19:16,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:19:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:19:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:19:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:19:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:19:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:19:16,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:19:16,666 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:19:16,668 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:19:17,247 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-02-06 10:19:17,247 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:19:17,263 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:19:17,263 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:19:17,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:17 BoogieIcfgContainer [2025-02-06 10:19:17,264 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:19:17,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:19:17,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:19:17,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:19:17,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:19:15" (1/3) ... [2025-02-06 10:19:17,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401069a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:17, skipping insertion in model container [2025-02-06 10:19:17,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:16" (2/3) ... [2025-02-06 10:19:17,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401069a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:17, skipping insertion in model container [2025-02-06 10:19:17,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:17" (3/3) ... [2025-02-06 10:19:17,278 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2025-02-06 10:19:17,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:19:17,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_of_cslls.i that has 1 procedures, 213 locations, 1 initial locations, 7 loop locations, and 104 error locations. [2025-02-06 10:19:17,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:19:17,347 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;@5374247b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:19:17,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-02-06 10:19:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 108 states have (on average 2.175925925925926) internal successors, (235), 212 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:19:17,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:17,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:19:17,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash 273042, now seen corresponding path program 1 times [2025-02-06 10:19:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624857376] [2025-02-06 10:19:17,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:17,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:19:17,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:19:17,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:17,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624857376] [2025-02-06 10:19:17,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624857376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:17,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925983788] [2025-02-06 10:19:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:17,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:17,624 INFO L87 Difference]: Start difference. First operand has 213 states, 108 states have (on average 2.175925925925926) internal successors, (235), 212 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:17,930 INFO L93 Difference]: Finished difference Result 282 states and 305 transitions. [2025-02-06 10:19:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:19:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:17,942 INFO L225 Difference]: With dead ends: 282 [2025-02-06 10:19:17,944 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 10:19:17,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:17,948 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 190 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:17,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 206 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 10:19:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 202. [2025-02-06 10:19:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 107 states have (on average 2.0373831775700935) internal successors, (218), 201 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2025-02-06 10:19:18,003 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 3 [2025-02-06 10:19:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2025-02-06 10:19:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2025-02-06 10:19:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:19:18,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:18,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:19:18,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:19:18,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash 273043, now seen corresponding path program 1 times [2025-02-06 10:19:18,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:18,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305348389] [2025-02-06 10:19:18,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:18,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:19:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:19:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305348389] [2025-02-06 10:19:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305348389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800186785] [2025-02-06 10:19:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:18,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:18,106 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:18,261 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2025-02-06 10:19:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:19:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:18,263 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:19:18,263 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 10:19:18,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:18,264 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:18,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 10:19:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-06 10:19:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 107 states have (on average 2.0186915887850465) internal successors, (216), 199 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2025-02-06 10:19:18,272 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 3 [2025-02-06 10:19:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2025-02-06 10:19:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2025-02-06 10:19:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:19:18,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:18,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:19:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:19:18,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -455533860, now seen corresponding path program 1 times [2025-02-06 10:19:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059327175] [2025-02-06 10:19:18,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:18,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:19:18,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:19:18,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:18,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059327175] [2025-02-06 10:19:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059327175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476334393] [2025-02-06 10:19:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:18,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:18,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:18,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:18,484 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand has 4 states, 3 states have (on average 2.0) 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-06 10:19:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:18,884 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2025-02-06 10:19:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:19:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) 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-06 10:19:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:18,886 INFO L225 Difference]: With dead ends: 355 [2025-02-06 10:19:18,886 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 10:19:18,886 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-06 10:19:18,886 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 279 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:18,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 240 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:19:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 10:19:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 193. [2025-02-06 10:19:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.9532710280373833) internal successors, (209), 192 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2025-02-06 10:19:18,904 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 6 [2025-02-06 10:19:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2025-02-06 10:19:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) 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-06 10:19:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2025-02-06 10:19:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:19:18,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:18,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:19:18,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1261011989, now seen corresponding path program 1 times [2025-02-06 10:19:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489865910] [2025-02-06 10:19:18,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:19:18,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:19:18,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:18,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489865910] [2025-02-06 10:19:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489865910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:19,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284472639] [2025-02-06 10:19:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:19,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:19,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:19,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:19,076 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:19,311 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2025-02-06 10:19:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:19,313 INFO L225 Difference]: With dead ends: 192 [2025-02-06 10:19:19,314 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 10:19:19,314 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-06 10:19:19,314 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:19,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 520 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 10:19:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 10:19:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 107 states have (on average 1.9439252336448598) internal successors, (208), 191 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2025-02-06 10:19:19,331 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 10 [2025-02-06 10:19:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:19,331 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2025-02-06 10:19:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2025-02-06 10:19:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:19:19,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:19,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:19,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:19:19,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1261011990, now seen corresponding path program 1 times [2025-02-06 10:19:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:19,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100424350] [2025-02-06 10:19:19,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:19,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:19:19,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:19:19,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:19,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100424350] [2025-02-06 10:19:19,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100424350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677811571] [2025-02-06 10:19:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:19,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:19,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:19,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:19,587 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:19,845 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2025-02-06 10:19:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:19,846 INFO L225 Difference]: With dead ends: 191 [2025-02-06 10:19:19,847 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 10:19:19,847 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-06 10:19:19,847 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 2 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:19,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 10:19:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-06 10:19:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 1.9345794392523366) internal successors, (207), 190 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 207 transitions. [2025-02-06 10:19:19,857 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 207 transitions. Word has length 10 [2025-02-06 10:19:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:19,857 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 207 transitions. [2025-02-06 10:19:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-06 10:19:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 207 transitions. [2025-02-06 10:19:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:19:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:19,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:19:19,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1258804120, now seen corresponding path program 1 times [2025-02-06 10:19:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752425169] [2025-02-06 10:19:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:19:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:19:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752425169] [2025-02-06 10:19:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752425169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623306315] [2025-02-06 10:19:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:20,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:20,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:20,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:20,195 INFO L87 Difference]: Start difference. First operand 191 states and 207 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:20,671 INFO L93 Difference]: Finished difference Result 354 states and 392 transitions. [2025-02-06 10:19:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:19:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:20,673 INFO L225 Difference]: With dead ends: 354 [2025-02-06 10:19:20,673 INFO L226 Difference]: Without dead ends: 354 [2025-02-06 10:19:20,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:20,674 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 463 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:20,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 631 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:19:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-06 10:19:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 195. [2025-02-06 10:19:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 111 states have (on average 1.9189189189189189) internal successors, (213), 194 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2025-02-06 10:19:20,682 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 15 [2025-02-06 10:19:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:20,682 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2025-02-06 10:19:20,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2025-02-06 10:19:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:19:20,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:20,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:20,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:19:20,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1258804119, now seen corresponding path program 1 times [2025-02-06 10:19:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534654021] [2025-02-06 10:19:20,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:20,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:19:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:19:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:20,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534654021] [2025-02-06 10:19:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534654021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:19:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041733085] [2025-02-06 10:19:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:21,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:19:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:21,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:19:21,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:19:21,095 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:21,733 INFO L93 Difference]: Finished difference Result 353 states and 391 transitions. [2025-02-06 10:19:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:19:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:19:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:21,736 INFO L225 Difference]: With dead ends: 353 [2025-02-06 10:19:21,736 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 10:19:21,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:19:21,737 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 546 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:21,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 511 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:19:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 10:19:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 195. [2025-02-06 10:19:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 111 states have (on average 1.90990990990991) internal successors, (212), 194 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2025-02-06 10:19:21,746 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 15 [2025-02-06 10:19:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:21,747 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2025-02-06 10:19:21,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2025-02-06 10:19:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:19:21,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:21,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:19:21,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:21,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash -368221878, now seen corresponding path program 1 times [2025-02-06 10:19:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813389959] [2025-02-06 10:19:21,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:21,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:19:21,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:19:21,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:21,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813389959] [2025-02-06 10:19:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813389959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405316704] [2025-02-06 10:19:21,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:21,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:21,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:21,833 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:21,954 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2025-02-06 10:19:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:21,956 INFO L225 Difference]: With dead ends: 192 [2025-02-06 10:19:21,956 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 10:19:21,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:21,957 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:21,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 10:19:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 10:19:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 111 states have (on average 1.882882882882883) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2025-02-06 10:19:21,965 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 16 [2025-02-06 10:19:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2025-02-06 10:19:21,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2025-02-06 10:19:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:19:21,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:21,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:21,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:19:21,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -368221877, now seen corresponding path program 1 times [2025-02-06 10:19:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969156344] [2025-02-06 10:19:21,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:19:21,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:19:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969156344] [2025-02-06 10:19:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969156344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:22,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:22,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989973705] [2025-02-06 10:19:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:22,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:22,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:22,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:22,044 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:22,154 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2025-02-06 10:19:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:22,156 INFO L225 Difference]: With dead ends: 190 [2025-02-06 10:19:22,156 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 10:19:22,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:22,156 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:22,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 287 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 10:19:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-06 10:19:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 111 states have (on average 1.864864864864865) internal successors, (207), 189 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2025-02-06 10:19:22,161 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 16 [2025-02-06 10:19:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:22,161 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2025-02-06 10:19:22,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-06 10:19:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2025-02-06 10:19:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:19:22,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:22,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:19:22,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1717742407, now seen corresponding path program 1 times [2025-02-06 10:19:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648094197] [2025-02-06 10:19:22,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:22,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:19:22,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:19:22,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648094197] [2025-02-06 10:19:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648094197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015357557] [2025-02-06 10:19:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:22,191 INFO L87 Difference]: Start difference. First operand 190 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:22,210 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2025-02-06 10:19:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:22,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:19:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:22,212 INFO L225 Difference]: With dead ends: 273 [2025-02-06 10:19:22,212 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 10:19:22,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:22,212 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 183 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 329 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 10:19:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 231. [2025-02-06 10:19:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 152 states have (on average 1.9473684210526316) internal successors, (296), 230 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2025-02-06 10:19:22,218 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 18 [2025-02-06 10:19:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:22,218 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2025-02-06 10:19:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2025-02-06 10:19:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:19:22,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:22,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:22,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:19:22,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:22,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1717735430, now seen corresponding path program 1 times [2025-02-06 10:19:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94104827] [2025-02-06 10:19:22,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:22,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:19:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:19:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94104827] [2025-02-06 10:19:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94104827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011722020] [2025-02-06 10:19:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:22,261 INFO L87 Difference]: Start difference. First operand 231 states and 296 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:22,503 INFO L93 Difference]: Finished difference Result 295 states and 363 transitions. [2025-02-06 10:19:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:19:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:22,505 INFO L225 Difference]: With dead ends: 295 [2025-02-06 10:19:22,505 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 10:19:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:22,506 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 265 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:22,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 176 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 10:19:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 225. [2025-02-06 10:19:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 161 states have (on average 1.7763975155279503) internal successors, (286), 224 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2025-02-06 10:19:22,514 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 18 [2025-02-06 10:19:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:22,514 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2025-02-06 10:19:22,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2025-02-06 10:19:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:19:22,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:22,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:19:22,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1717735429, now seen corresponding path program 1 times [2025-02-06 10:19:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:22,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981823981] [2025-02-06 10:19:22,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:19:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:19:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981823981] [2025-02-06 10:19:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981823981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:22,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182072976] [2025-02-06 10:19:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:22,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:22,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:22,597 INFO L87 Difference]: Start difference. First operand 225 states and 286 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:22,945 INFO L93 Difference]: Finished difference Result 466 states and 561 transitions. [2025-02-06 10:19:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:19:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:19:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:22,949 INFO L225 Difference]: With dead ends: 466 [2025-02-06 10:19:22,949 INFO L226 Difference]: Without dead ends: 466 [2025-02-06 10:19:22,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-06 10:19:22,950 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 503 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:22,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 317 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-06 10:19:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 379. [2025-02-06 10:19:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 315 states have (on average 1.7333333333333334) internal successors, (546), 378 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 546 transitions. [2025-02-06 10:19:22,962 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 546 transitions. Word has length 18 [2025-02-06 10:19:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 546 transitions. [2025-02-06 10:19:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 546 transitions. [2025-02-06 10:19:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:22,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:22,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:19:22,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -351317852, now seen corresponding path program 1 times [2025-02-06 10:19:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042343084] [2025-02-06 10:19:22,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:22,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:22,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042343084] [2025-02-06 10:19:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042343084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233669150] [2025-02-06 10:19:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:23,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:23,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:23,098 INFO L87 Difference]: Start difference. First operand 379 states and 546 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:23,466 INFO L93 Difference]: Finished difference Result 515 states and 749 transitions. [2025-02-06 10:19:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:19:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:23,468 INFO L225 Difference]: With dead ends: 515 [2025-02-06 10:19:23,469 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 10:19:23,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:23,469 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 177 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:23,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 692 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 10:19:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 378. [2025-02-06 10:19:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 315 states have (on average 1.7301587301587302) internal successors, (545), 377 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 545 transitions. [2025-02-06 10:19:23,478 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 545 transitions. Word has length 19 [2025-02-06 10:19:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:23,478 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 545 transitions. [2025-02-06 10:19:23,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 545 transitions. [2025-02-06 10:19:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:23,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:23,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:23,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:19:23,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:23,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash -351317851, now seen corresponding path program 1 times [2025-02-06 10:19:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194189697] [2025-02-06 10:19:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:23,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:23,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:23,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:23,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:23,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194189697] [2025-02-06 10:19:23,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194189697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:23,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:23,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:19:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481226240] [2025-02-06 10:19:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:23,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:19:23,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:23,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:19:23,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:23,802 INFO L87 Difference]: Start difference. First operand 378 states and 545 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:24,345 INFO L93 Difference]: Finished difference Result 668 states and 946 transitions. [2025-02-06 10:19:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:19:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:19:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:24,348 INFO L225 Difference]: With dead ends: 668 [2025-02-06 10:19:24,348 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 10:19:24,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:19:24,349 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 464 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:24,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 836 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:19:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 10:19:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 382. [2025-02-06 10:19:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 319 states have (on average 1.7210031347962382) internal successors, (549), 381 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 549 transitions. [2025-02-06 10:19:24,360 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 549 transitions. Word has length 19 [2025-02-06 10:19:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:24,361 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 549 transitions. [2025-02-06 10:19:24,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 549 transitions. [2025-02-06 10:19:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:19:24,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:24,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:24,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:19:24,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:24,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 688999087, now seen corresponding path program 1 times [2025-02-06 10:19:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222276893] [2025-02-06 10:19:24,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:24,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:24,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222276893] [2025-02-06 10:19:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222276893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767278217] [2025-02-06 10:19:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:24,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:24,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:24,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:24,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:24,396 INFO L87 Difference]: Start difference. First operand 382 states and 549 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:24,406 INFO L93 Difference]: Finished difference Result 386 states and 553 transitions. [2025-02-06 10:19:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2025-02-06 10:19:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:24,408 INFO L225 Difference]: With dead ends: 386 [2025-02-06 10:19:24,408 INFO L226 Difference]: Without dead ends: 386 [2025-02-06 10:19:24,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:24,409 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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-06 10:19:24,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-06 10:19:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-06 10:19:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 323 states have (on average 1.7120743034055728) internal successors, (553), 385 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 553 transitions. [2025-02-06 10:19:24,417 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 553 transitions. Word has length 24 [2025-02-06 10:19:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:24,418 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 553 transitions. [2025-02-06 10:19:24,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 553 transitions. [2025-02-06 10:19:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:19:24,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:24,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:24,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:19:24,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:24,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1267909794, now seen corresponding path program 1 times [2025-02-06 10:19:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:24,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987319089] [2025-02-06 10:19:24,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:24,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:24,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:24,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987319089] [2025-02-06 10:19:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987319089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324670658] [2025-02-06 10:19:24,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:24,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:24,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:24,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:19:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:24,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:24,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:19:24,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:24,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:19:24,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:24,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 10:19:24,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:25,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:25,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-02-06 10:19:25,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:25,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 10:19:25,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-02-06 10:19:25,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:25,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:19:25,170 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-06 10:19:25,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-02-06 10:19:25,211 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 31 treesize of output 13 [2025-02-06 10:19:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:25,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:25,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) 1)) is different from false [2025-02-06 10:19:25,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_460))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 10:19:25,327 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-06 10:19:25,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 32 [2025-02-06 10:19:25,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_460))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) is different from false [2025-02-06 10:19:25,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_460))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) is different from false [2025-02-06 10:19:25,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:25,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2025-02-06 10:19:25,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:25,587 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 338 treesize of output 260 [2025-02-06 10:19:25,598 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 20 treesize of output 12 [2025-02-06 10:19:25,602 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 3 [2025-02-06 10:19:25,611 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:19:25,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-02-06 10:19:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-06 10:19:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324670658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:25,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 23 [2025-02-06 10:19:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113490281] [2025-02-06 10:19:25,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:25,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:19:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:25,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:19:25,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=304, Unknown=17, NotChecked=156, Total=552 [2025-02-06 10:19:25,653 INFO L87 Difference]: Start difference. First operand 386 states and 553 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 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-06 10:19:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:26,614 INFO L93 Difference]: Finished difference Result 630 states and 895 transitions. [2025-02-06 10:19:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:19:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 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) Word has length 24 [2025-02-06 10:19:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:26,617 INFO L225 Difference]: With dead ends: 630 [2025-02-06 10:19:26,617 INFO L226 Difference]: Without dead ends: 630 [2025-02-06 10:19:26,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=464, Unknown=17, NotChecked=196, Total=812 [2025-02-06 10:19:26,618 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 393 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1140 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:26,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1952 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1259 Invalid, 0 Unknown, 1140 Unchecked, 0.8s Time] [2025-02-06 10:19:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-06 10:19:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 385. [2025-02-06 10:19:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 323 states have (on average 1.7089783281733746) internal successors, (552), 384 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 552 transitions. [2025-02-06 10:19:26,628 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 552 transitions. Word has length 24 [2025-02-06 10:19:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:26,628 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 552 transitions. [2025-02-06 10:19:26,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 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-06 10:19:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 552 transitions. [2025-02-06 10:19:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:19:26,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:26,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:26,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:19:26,832 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,SelfDestructingSolverStorable15 [2025-02-06 10:19:26,832 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 101 more)] === [2025-02-06 10:19:26,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1267909795, now seen corresponding path program 1 times [2025-02-06 10:19:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073154056] [2025-02-06 10:19:26,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:26,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:26,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:26,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:26,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073154056] [2025-02-06 10:19:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073154056] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732290758] [2025-02-06 10:19:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:27,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:27,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:19:27,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:19:27,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:19:27,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:27,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:27,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:19:27,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:27,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:19:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:19:27,795 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:19:27,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:19:27,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:27,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:27,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2025-02-06 10:19:28,011 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-02-06 10:19:28,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-02-06 10:19:28,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:19:28,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-02-06 10:19:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:19:28,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:28,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 10:19:28,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 10:19:28,299 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-06 10:19:28,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-02-06 10:19:28,335 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 31 treesize of output 13 [2025-02-06 10:19:28,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:19:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:28,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:28,824 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 663 treesize of output 621 [2025-02-06 10:19:28,849 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 303 treesize of output 295 [2025-02-06 10:19:28,860 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 295 treesize of output 287 [2025-02-06 10:19:28,870 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 287 treesize of output 279 [2025-02-06 10:19:28,879 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 279 treesize of output 271 [2025-02-06 10:19:30,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:30,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 82 [2025-02-06 10:19:30,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:30,078 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 911 treesize of output 755 [2025-02-06 10:19:30,091 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 70 treesize of output 66 [2025-02-06 10:19:30,096 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 83 treesize of output 59 [2025-02-06 10:19:30,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:30,549 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2025-02-06 10:19:30,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:30,554 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 68 treesize of output 50 [2025-02-06 10:19:30,558 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 18 treesize of output 10 [2025-02-06 10:19:30,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:30,571 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2025-02-06 10:19:30,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:30,576 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 68 treesize of output 50 [2025-02-06 10:19:30,581 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 18 treesize of output 10 [2025-02-06 10:19:32,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 14112 treesize of output 14227