./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:25:19,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:25:19,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:25:19,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:25:19,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:25:19,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:25:19,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:25:19,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:25:19,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:25:19,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:25:19,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:25:19,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:25:19,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:25:19,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:25:19,250 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:25:19,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:25:19,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:25:19,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:19,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:25:19,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:25:19,252 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2025-02-08 06:25:19,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:25:19,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:25:19,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:25:19,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:25:19,591 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:25:19,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2025-02-08 06:25:20,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3be778614/8cd4567576ce421ab37c8c0a4f565936/FLAGadb1d68be [2025-02-08 06:25:21,222 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:25:21,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2025-02-08 06:25:21,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3be778614/8cd4567576ce421ab37c8c0a4f565936/FLAGadb1d68be [2025-02-08 06:25:21,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3be778614/8cd4567576ce421ab37c8c0a4f565936 [2025-02-08 06:25:21,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:25:21,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:25:21,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:21,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:25:21,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:25:21,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21, skipping insertion in model container [2025-02-08 06:25:21,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:25:21,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:21,574 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:25:21,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:21,635 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:25:21,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21 WrapperNode [2025-02-08 06:25:21,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:21,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:21,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:25:21,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:25:21,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,686 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2025-02-08 06:25:21,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:21,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:25:21,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:25:21,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:25:21,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,726 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2025-02-08 06:25:21,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:25:21,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:25:21,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:25:21,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:25:21,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (1/1) ... [2025-02-08 06:25:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:21,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:25:21,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:25:21,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:25:21,899 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:25:21,901 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:25:22,393 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2025-02-08 06:25:22,394 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:25:22,412 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:25:22,413 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:25:22,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:22 BoogieIcfgContainer [2025-02-08 06:25:22,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:25:22,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:25:22,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:25:22,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:25:22,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:25:21" (1/3) ... [2025-02-08 06:25:22,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:22, skipping insertion in model container [2025-02-08 06:25:22,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:21" (2/3) ... [2025-02-08 06:25:22,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:22, skipping insertion in model container [2025-02-08 06:25:22,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:22" (3/3) ... [2025-02-08 06:25:22,424 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2025-02-08 06:25:22,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:25:22,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_stack.i that has 1 procedures, 137 locations, 1 initial locations, 3 loop locations, and 67 error locations. [2025-02-08 06:25:22,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:25:22,506 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;@16fa357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:25:22,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-02-08 06:25:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 69 states have (on average 2.1594202898550723) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:25:22,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:22,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:25:22,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash 5791, now seen corresponding path program 1 times [2025-02-08 06:25:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606340896] [2025-02-08 06:25:22,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:22,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:25:22,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:25:22,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:22,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606340896] [2025-02-08 06:25:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606340896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:22,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:25:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280690240] [2025-02-08 06:25:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:22,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:22,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:22,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:22,777 INFO L87 Difference]: Start difference. First operand has 137 states, 69 states have (on average 2.1594202898550723) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:22,989 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2025-02-08 06:25:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:25:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:23,000 INFO L225 Difference]: With dead ends: 135 [2025-02-08 06:25:23,002 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 06:25:23,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,008 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:23,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 128 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 06:25:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-08 06:25:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 2.1029411764705883) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2025-02-08 06:25:23,060 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 2 [2025-02-08 06:25:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:23,060 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2025-02-08 06:25:23,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2025-02-08 06:25:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:25:23,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:23,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:25:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:25:23,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 5792, now seen corresponding path program 1 times [2025-02-08 06:25:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-02-08 06:25:23,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:23,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:25:23,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:25:23,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:23,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-02-08 06:25:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505731106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:23,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:23,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:25:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001413505] [2025-02-08 06:25:23,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:23,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,190 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:23,324 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2025-02-08 06:25:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:23,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:25:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:23,326 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:25:23,326 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 06:25:23,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,326 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 83 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:23,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 06:25:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 06:25:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 68 states have (on average 2.073529411764706) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2025-02-08 06:25:23,340 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 2 [2025-02-08 06:25:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:23,340 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2025-02-08 06:25:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2025-02-08 06:25:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:25:23,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:23,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:25:23,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:23,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1602632177, now seen corresponding path program 1 times [2025-02-08 06:25:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:23,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-02-08 06:25:23,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:23,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:25:23,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:25:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:23,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:23,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-02-08 06:25:23,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400029858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:23,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:23,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83286279] [2025-02-08 06:25:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:23,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:23,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:23,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,458 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:23,565 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2025-02-08 06:25:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:23,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:25:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:23,566 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:25:23,566 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 06:25:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,567 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:23,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 06:25:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 06:25:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 2.0428571428571427) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2025-02-08 06:25:23,573 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 7 [2025-02-08 06:25:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2025-02-08 06:25:23,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2025-02-08 06:25:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:25:23,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:23,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:25:23,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:23,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1602632176, now seen corresponding path program 1 times [2025-02-08 06:25:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-08 06:25:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:23,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:25:23,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:25:23,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-08 06:25:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210561572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:23,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:23,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:23,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083566849] [2025-02-08 06:25:23,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:23,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:23,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,681 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:23,784 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-02-08 06:25:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:23,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:25:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:23,785 INFO L225 Difference]: With dead ends: 129 [2025-02-08 06:25:23,785 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 06:25:23,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:23,786 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:23,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 201 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 06:25:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-08 06:25:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 2.0) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-02-08 06:25:23,799 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 7 [2025-02-08 06:25:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:23,799 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-02-08 06:25:23,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-02-08 06:25:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:25:23,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:23,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:25:23,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:23,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1602628752, now seen corresponding path program 1 times [2025-02-08 06:25:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846973395] [2025-02-08 06:25:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:23,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:25:23,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:25:23,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:23,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846973395] [2025-02-08 06:25:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846973395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:23,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563124148] [2025-02-08 06:25:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:23,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:23,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:23,874 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:24,059 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2025-02-08 06:25:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:25:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:24,061 INFO L225 Difference]: With dead ends: 130 [2025-02-08 06:25:24,061 INFO L226 Difference]: Without dead ends: 130 [2025-02-08 06:25:24,061 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-08 06:25:24,063 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 141 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:24,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-08 06:25:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2025-02-08 06:25:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 115 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2025-02-08 06:25:24,073 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 7 [2025-02-08 06:25:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2025-02-08 06:25:24,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2025-02-08 06:25:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:25:24,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:24,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:25:24,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1602628751, now seen corresponding path program 1 times [2025-02-08 06:25:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929551314] [2025-02-08 06:25:24,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:25:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:25:24,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:24,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929551314] [2025-02-08 06:25:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929551314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613290745] [2025-02-08 06:25:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:24,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:24,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:24,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:24,230 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:24,424 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2025-02-08 06:25:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:24,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:25:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:24,426 INFO L225 Difference]: With dead ends: 166 [2025-02-08 06:25:24,427 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 06:25:24,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-08 06:25:24,428 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 159 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:24,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 172 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 06:25:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2025-02-08 06:25:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2025-02-08 06:25:24,437 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 7 [2025-02-08 06:25:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:24,437 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2025-02-08 06:25:24,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2025-02-08 06:25:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:25:24,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:24,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:25:24,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:24,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1158700505, now seen corresponding path program 1 times [2025-02-08 06:25:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-02-08 06:25:24,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:24,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:25:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:25:24,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:24,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-02-08 06:25:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989358084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387036886] [2025-02-08 06:25:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:24,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:24,480 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:24,502 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2025-02-08 06:25:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:25:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:24,504 INFO L225 Difference]: With dead ends: 146 [2025-02-08 06:25:24,504 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 06:25:24,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:24,505 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:24,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 06:25:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-02-08 06:25:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2025-02-08 06:25:24,518 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 10 [2025-02-08 06:25:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2025-02-08 06:25:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2025-02-08 06:25:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:25:24,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:24,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:24,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:25:24,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087644, now seen corresponding path program 1 times [2025-02-08 06:25:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623444234] [2025-02-08 06:25:24,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:24,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:25:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:25:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623444234] [2025-02-08 06:25:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623444234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:24,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691881056] [2025-02-08 06:25:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:24,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:24,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:24,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:24,637 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:24,831 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2025-02-08 06:25:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:25:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:24,832 INFO L225 Difference]: With dead ends: 159 [2025-02-08 06:25:24,832 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:25:24,833 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-08 06:25:24,833 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 21 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:24,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 203 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:25:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2025-02-08 06:25:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 113 states have (on average 1.6194690265486726) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2025-02-08 06:25:24,842 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 12 [2025-02-08 06:25:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:24,842 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2025-02-08 06:25:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2025-02-08 06:25:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:25:24,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:24,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:24,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:25:24,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087645, now seen corresponding path program 1 times [2025-02-08 06:25:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-02-08 06:25:24,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:25:24,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:25:24,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:24,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:24,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-02-08 06:25:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354634405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943625680] [2025-02-08 06:25:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:24,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:24,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:24,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:24,919 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:25,071 INFO L93 Difference]: Finished difference Result 154 states and 181 transitions. [2025-02-08 06:25:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:25:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:25,072 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:25:25,072 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:25:25,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:25,073 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 285 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:25:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2025-02-08 06:25:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2025-02-08 06:25:25,079 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 12 [2025-02-08 06:25:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2025-02-08 06:25:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2025-02-08 06:25:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:25:25,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:25,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:25:25,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:25,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1448475050, now seen corresponding path program 1 times [2025-02-08 06:25:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-02-08 06:25:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:25,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:25:25,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:25:25,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:25,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-02-08 06:25:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221803913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365488274] [2025-02-08 06:25:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:25,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:25,176 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 06:25:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:25,258 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2025-02-08 06:25:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 06:25:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:25,260 INFO L225 Difference]: With dead ends: 156 [2025-02-08 06:25:25,260 INFO L226 Difference]: Without dead ends: 156 [2025-02-08 06:25:25,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:25,261 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 19 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:25,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 291 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-08 06:25:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2025-02-08 06:25:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 116 states have (on average 1.5603448275862069) internal successors, (181), 150 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2025-02-08 06:25:25,265 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 15 [2025-02-08 06:25:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:25,266 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2025-02-08 06:25:25,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 06:25:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2025-02-08 06:25:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:25:25,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:25,266 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:25,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:25:25,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:25,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -453068382, now seen corresponding path program 1 times [2025-02-08 06:25:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-02-08 06:25:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:25,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:25:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:25:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:25,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-02-08 06:25:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977235876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:25,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447792565] [2025-02-08 06:25:25,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:25,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:25,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:25,297 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08 06:25:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:25,307 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2025-02-08 06:25:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08 06:25:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:25,311 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:25:25,312 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:25:25,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:25,312 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:25,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:25:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:25:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2025-02-08 06:25:25,318 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 15 [2025-02-08 06:25:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2025-02-08 06:25:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08 06:25:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2025-02-08 06:25:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:25:25,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:25,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:25,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:25:25,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 415119431, now seen corresponding path program 1 times [2025-02-08 06:25:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-02-08 06:25:25,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:25,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:25:25,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:25:25,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:25,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-02-08 06:25:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:25:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611483741] [2025-02-08 06:25:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:25,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:25:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:25,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:25:25,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:25:25,793 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:26,336 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2025-02-08 06:25:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:25:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 06:25:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:26,338 INFO L225 Difference]: With dead ends: 168 [2025-02-08 06:25:26,338 INFO L226 Difference]: Without dead ends: 168 [2025-02-08 06:25:26,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:25:26,339 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 210 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:26,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 307 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-08 06:25:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2025-02-08 06:25:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.5365853658536586) internal successors, (189), 157 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2025-02-08 06:25:26,347 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 17 [2025-02-08 06:25:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2025-02-08 06:25:26,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2025-02-08 06:25:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:25:26,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:26,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:26,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:25:26,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 415119432, now seen corresponding path program 1 times [2025-02-08 06:25:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-08 06:25:26,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:26,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:25:26,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:25:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:26,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-08 06:25:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:25:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233099860] [2025-02-08 06:25:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:26,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:25:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:26,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:25:26,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:25:26,963 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:27,549 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2025-02-08 06:25:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 06:25:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:27,551 INFO L225 Difference]: With dead ends: 189 [2025-02-08 06:25:27,551 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 06:25:27,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:25:27,552 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 179 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:27,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 382 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 06:25:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2025-02-08 06:25:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 172 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 206 transitions. [2025-02-08 06:25:27,557 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 206 transitions. Word has length 17 [2025-02-08 06:25:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:27,557 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 206 transitions. [2025-02-08 06:25:27,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 206 transitions. [2025-02-08 06:25:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:25:27,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:27,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:27,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:25:27,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:27,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash 22733792, now seen corresponding path program 1 times [2025-02-08 06:25:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:27,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960272278] [2025-02-08 06:25:27,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:27,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:27,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:25:27,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:25:27,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:27,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:27,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:27,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960272278] [2025-02-08 06:25:27,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960272278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:27,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:25:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814029216] [2025-02-08 06:25:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:27,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:25:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:27,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:25:27,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:27,708 INFO L87 Difference]: Start difference. First operand 173 states and 206 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:27,892 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2025-02-08 06:25:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:25:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 06:25:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:27,893 INFO L225 Difference]: With dead ends: 205 [2025-02-08 06:25:27,894 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 06:25:27,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:25:27,894 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:27,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 431 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 06:25:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2025-02-08 06:25:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 153 states have (on average 1.477124183006536) internal successors, (226), 187 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 226 transitions. [2025-02-08 06:25:27,901 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 226 transitions. Word has length 17 [2025-02-08 06:25:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:27,902 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 226 transitions. [2025-02-08 06:25:27,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 226 transitions. [2025-02-08 06:25:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:27,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:27,903 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-08 06:25:27,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:25:27,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -425001719, now seen corresponding path program 1 times [2025-02-08 06:25:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-02-08 06:25:27,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:27,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:27,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:27,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:27,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-02-08 06:25:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072648300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675362716] [2025-02-08 06:25:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:27,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:27,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:27,981 INFO L87 Difference]: Start difference. First operand 188 states and 226 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-08 06:25:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:28,118 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2025-02-08 06:25:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:28,118 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-08 06:25:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:28,119 INFO L225 Difference]: With dead ends: 187 [2025-02-08 06:25:28,119 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 06:25:28,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:28,120 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:28,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 272 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 06:25:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 06:25:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 186 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 224 transitions. [2025-02-08 06:25:28,125 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 224 transitions. Word has length 18 [2025-02-08 06:25:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 224 transitions. [2025-02-08 06:25:28,125 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-08 06:25:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 224 transitions. [2025-02-08 06:25:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:28,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:28,126 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-08 06:25:28,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:25:28,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -425001718, now seen corresponding path program 1 times [2025-02-08 06:25:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880506046] [2025-02-08 06:25:28,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:28,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:28,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:28,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:28,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880506046] [2025-02-08 06:25:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880506046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:28,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127517531] [2025-02-08 06:25:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:28,295 INFO L87 Difference]: Start difference. First operand 187 states and 224 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-08 06:25:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:28,443 INFO L93 Difference]: Finished difference Result 186 states and 222 transitions. [2025-02-08 06:25:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:28,443 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-08 06:25:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:28,444 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:25:28,444 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:25:28,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:28,445 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:28,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 254 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:25:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-08 06:25:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 185 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-02-08 06:25:28,453 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 18 [2025-02-08 06:25:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:28,453 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-02-08 06:25:28,453 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-08 06:25:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-02-08 06:25:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:25:28,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:28,454 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] [2025-02-08 06:25:28,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:25:28,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 337441332, now seen corresponding path program 1 times [2025-02-08 06:25:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-02-08 06:25:28,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:25:28,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:25:28,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:28,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-02-08 06:25:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508775657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:25:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611663376] [2025-02-08 06:25:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:28,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:25:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:28,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:25:28,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:25:28,637 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:28,932 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2025-02-08 06:25:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:25:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:28,934 INFO L225 Difference]: With dead ends: 197 [2025-02-08 06:25:28,934 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 06:25:28,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-08 06:25:28,935 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:28,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 269 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 06:25:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2025-02-08 06:25:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 184 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 220 transitions. [2025-02-08 06:25:28,941 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 220 transitions. Word has length 21 [2025-02-08 06:25:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:28,942 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 220 transitions. [2025-02-08 06:25:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 220 transitions. [2025-02-08 06:25:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:25:28,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:28,943 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] [2025-02-08 06:25:28,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:25:28,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:28,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash 337441333, now seen corresponding path program 1 times [2025-02-08 06:25:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:28,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-02-08 06:25:28,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:28,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:25:28,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:25:28,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-02-08 06:25:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512665373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:29,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:25:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717929570] [2025-02-08 06:25:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:25:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:29,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:25:29,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:25:29,204 INFO L87 Difference]: Start difference. First operand 185 states and 220 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:29,464 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2025-02-08 06:25:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:25:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:29,465 INFO L225 Difference]: With dead ends: 196 [2025-02-08 06:25:29,465 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 06:25:29,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-08 06:25:29,466 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:29,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 06:25:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2025-02-08 06:25:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 183 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-08 06:25:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2025-02-08 06:25:29,471 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 21 [2025-02-08 06:25:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:29,471 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2025-02-08 06:25:29,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2025-02-08 06:25:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:25:29,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:29,472 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] [2025-02-08 06:25:29,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:25:29,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:29,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1227943461, now seen corresponding path program 1 times [2025-02-08 06:25:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798904773] [2025-02-08 06:25:29,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:29,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:25:29,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:25:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:29,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798904773] [2025-02-08 06:25:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798904773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:25:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630783050] [2025-02-08 06:25:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:29,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:25:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:29,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:25:29,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:25:29,704 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:30,063 INFO L93 Difference]: Finished difference Result 200 states and 234 transitions. [2025-02-08 06:25:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 06:25:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:30,065 INFO L225 Difference]: With dead ends: 200 [2025-02-08 06:25:30,065 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 06:25:30,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:25:30,065 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 172 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:30,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 472 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:25:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 06:25:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2025-02-08 06:25:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 185 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2025-02-08 06:25:30,069 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 22 [2025-02-08 06:25:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2025-02-08 06:25:30,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2025-02-08 06:25:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:25:30,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:30,070 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] [2025-02-08 06:25:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:25:30,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash -539743769, now seen corresponding path program 1 times [2025-02-08 06:25:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-02-08 06:25:30,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:30,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:25:30,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:25:30,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-02-08 06:25:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048115089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:30,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010568247] [2025-02-08 06:25:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:30,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:30,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:30,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:30,141 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:30,270 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2025-02-08 06:25:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-08 06:25:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:30,271 INFO L225 Difference]: With dead ends: 185 [2025-02-08 06:25:30,271 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 06:25:30,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:30,272 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:30,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 06:25:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-08 06:25:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 155 states have (on average 1.4064516129032258) internal successors, (218), 184 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-08 06:25:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2025-02-08 06:25:30,276 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 22 [2025-02-08 06:25:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:30,276 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2025-02-08 06:25:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2025-02-08 06:25:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:25:30,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:30,277 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] [2025-02-08 06:25:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:25:30,277 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:30,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:30,278 INFO L85 PathProgramCache]: Analyzing trace with hash -539743768, now seen corresponding path program 1 times [2025-02-08 06:25:30,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-02-08 06:25:30,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:30,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:25:30,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:25:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:30,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-02-08 06:25:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557025848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968042570] [2025-02-08 06:25:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:30,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:30,424 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:30,574 INFO L93 Difference]: Finished difference Result 184 states and 216 transitions. [2025-02-08 06:25:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-08 06:25:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:30,575 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:25:30,576 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 06:25:30,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:30,576 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:30,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 06:25:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-08 06:25:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 155 states have (on average 1.3935483870967742) internal successors, (216), 183 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-08 06:25:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 216 transitions. [2025-02-08 06:25:30,581 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 216 transitions. Word has length 22 [2025-02-08 06:25:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:30,581 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 216 transitions. [2025-02-08 06:25:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 216 transitions. [2025-02-08 06:25:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:25:30,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:30,582 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, 1] [2025-02-08 06:25:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:25:30,582 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1427213464, now seen corresponding path program 1 times [2025-02-08 06:25:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889382153] [2025-02-08 06:25:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:30,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:30,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:30,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889382153] [2025-02-08 06:25:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889382153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645514666] [2025-02-08 06:25:30,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:30,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:30,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:25:30,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:30,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:30,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 06:25:30,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:31,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:25:31,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:31,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2025-02-08 06:25:31,510 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:25:31,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-02-08 06:25:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:31,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:32,011 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 41 treesize of output 37 [2025-02-08 06:25:32,018 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 68 treesize of output 64 [2025-02-08 06:25:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645514666] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:32,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2025-02-08 06:25:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920909014] [2025-02-08 06:25:32,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:25:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:32,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:25:32,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:25:32,247 INFO L87 Difference]: Start difference. First operand 184 states and 216 transitions. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:33,457 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2025-02-08 06:25:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:25:33,461 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:25:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:33,462 INFO L225 Difference]: With dead ends: 228 [2025-02-08 06:25:33,462 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 06:25:33,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 06:25:33,466 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:33,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1086 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:25:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 06:25:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2025-02-08 06:25:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 202 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2025-02-08 06:25:33,472 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 25 [2025-02-08 06:25:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:33,472 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2025-02-08 06:25:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2025-02-08 06:25:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:25:33,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:33,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:33,482 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-08 06:25:33,674 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,SelfDestructingSolverStorable21 [2025-02-08 06:25:33,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:33,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1427211833, now seen corresponding path program 1 times [2025-02-08 06:25:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-02-08 06:25:33,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:33,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:33,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:33,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:33,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-02-08 06:25:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514110255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32538532] [2025-02-08 06:25:33,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:33,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:33,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:33,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:33,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:25:33,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:33,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:33,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:33,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 06:25:33,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:33,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:25:33,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:25:33,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:25:33,955 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 27 treesize of output 11 [2025-02-08 06:25:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:34,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32538532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:34,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 06:25:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666727145] [2025-02-08 06:25:34,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:34,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:34,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:34,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:34,074 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:34,148 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2025-02-08 06:25:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:25:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:34,149 INFO L225 Difference]: With dead ends: 206 [2025-02-08 06:25:34,150 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 06:25:34,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:34,150 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:34,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 362 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 06:25:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2025-02-08 06:25:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 200 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2025-02-08 06:25:34,156 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 25 [2025-02-08 06:25:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:34,156 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2025-02-08 06:25:34,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2025-02-08 06:25:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:25:34,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:34,159 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, 1] [2025-02-08 06:25:34,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:34,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:34,363 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:34,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 850971581, now seen corresponding path program 1 times [2025-02-08 06:25:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400112509] [2025-02-08 06:25:34,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:34,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:34,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:34,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400112509] [2025-02-08 06:25:34,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400112509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:34,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:34,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:25:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088201639] [2025-02-08 06:25:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:34,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:25:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:34,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:25:34,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:25:34,620 INFO L87 Difference]: Start difference. First operand 201 states and 234 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:34,913 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2025-02-08 06:25:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:25:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:34,914 INFO L225 Difference]: With dead ends: 220 [2025-02-08 06:25:34,915 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 06:25:34,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:25:34,915 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:34,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 264 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 06:25:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2025-02-08 06:25:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 172 states have (on average 1.3546511627906976) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2025-02-08 06:25:34,921 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 25 [2025-02-08 06:25:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:34,921 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2025-02-08 06:25:34,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2025-02-08 06:25:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:25:34,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:34,922 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, 1] [2025-02-08 06:25:34,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:25:34,923 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:34,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash 850971580, now seen corresponding path program 1 times [2025-02-08 06:25:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246532333] [2025-02-08 06:25:34,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:25:34,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:25:34,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:34,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,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-08 06:25:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246532333] [2025-02-08 06:25:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246532333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:25:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854374783] [2025-02-08 06:25:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:25:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:25:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:25:35,077 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:35,350 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2025-02-08 06:25:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:25:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:35,351 INFO L225 Difference]: With dead ends: 219 [2025-02-08 06:25:35,351 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 06:25:35,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:25:35,352 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:35,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 256 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 06:25:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2025-02-08 06:25:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 198 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 232 transitions. [2025-02-08 06:25:35,358 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 232 transitions. Word has length 25 [2025-02-08 06:25:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:35,358 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 232 transitions. [2025-02-08 06:25:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 232 transitions. [2025-02-08 06:25:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:25:35,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:35,360 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, 1, 1, 1, 1, 1] [2025-02-08 06:25:35,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 06:25:35,360 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1132709197, now seen corresponding path program 1 times [2025-02-08 06:25:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612568229] [2025-02-08 06:25:35,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:35,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:25:35,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:25:35,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:35,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612568229] [2025-02-08 06:25:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612568229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:35,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:35,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148206422] [2025-02-08 06:25:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:35,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:35,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:35,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:35,414 INFO L87 Difference]: Start difference. First operand 199 states and 232 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:35,459 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2025-02-08 06:25:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 06:25:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:35,461 INFO L225 Difference]: With dead ends: 206 [2025-02-08 06:25:35,461 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 06:25:35,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 06:25:35,462 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:35,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 266 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 06:25:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2025-02-08 06:25:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3430232558139534) internal successors, (231), 198 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2025-02-08 06:25:35,472 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 29 [2025-02-08 06:25:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:35,472 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2025-02-08 06:25:35,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2025-02-08 06:25:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:25:35,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:35,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:35,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 06:25:35,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1132710828, now seen corresponding path program 1 times [2025-02-08 06:25:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261009319] [2025-02-08 06:25:35,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:35,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:25:35,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:25:35,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261009319] [2025-02-08 06:25:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261009319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:35,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:35,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:25:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064584000] [2025-02-08 06:25:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:35,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:25:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:35,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:25:35,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:35,604 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:35,852 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2025-02-08 06:25:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 06:25:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:35,853 INFO L225 Difference]: With dead ends: 224 [2025-02-08 06:25:35,854 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 06:25:35,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:25:35,854 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 71 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:35,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 192 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 06:25:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 199. [2025-02-08 06:25:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 198 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2025-02-08 06:25:35,861 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 29 [2025-02-08 06:25:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:35,861 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2025-02-08 06:25:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2025-02-08 06:25:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:25:35,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:35,862 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:35,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 06:25:35,863 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:35,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1908380425, now seen corresponding path program 1 times [2025-02-08 06:25:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-08 06:25:35,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:25:35,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:25:35,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:25:35,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:35,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-08 06:25:35,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:35,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117135142] [2025-02-08 06:25:35,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:35,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:35,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:35,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:35,921 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:36,012 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2025-02-08 06:25:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:25:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:25:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:36,013 INFO L225 Difference]: With dead ends: 198 [2025-02-08 06:25:36,013 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 06:25:36,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:36,015 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:36,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 190 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 06:25:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 06:25:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 197 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2025-02-08 06:25:36,020 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 31 [2025-02-08 06:25:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:36,020 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2025-02-08 06:25:36,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2025-02-08 06:25:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:25:36,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:36,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:36,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 06:25:36,021 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1237754271, now seen corresponding path program 1 times [2025-02-08 06:25:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-02-08 06:25:36,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:25:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:25:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-02-08 06:25:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049930952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:36,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 06:25:36,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297471998] [2025-02-08 06:25:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:25:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:36,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:25:36,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:25:36,601 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:37,217 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2025-02-08 06:25:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:25:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 06:25:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:37,219 INFO L225 Difference]: With dead ends: 227 [2025-02-08 06:25:37,219 INFO L226 Difference]: Without dead ends: 216 [2025-02-08 06:25:37,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:25:37,220 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 139 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:37,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 589 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-08 06:25:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2025-02-08 06:25:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 172 states have (on average 1.319767441860465) internal successors, (227), 197 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2025-02-08 06:25:37,225 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 36 [2025-02-08 06:25:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2025-02-08 06:25:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2025-02-08 06:25:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:25:37,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:37,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 06:25:37,227 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:37,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1098960353, now seen corresponding path program 1 times [2025-02-08 06:25:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-02-08 06:25:37,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:37,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:25:37,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:25:37,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-02-08 06:25:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916309551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 06:25:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405935233] [2025-02-08 06:25:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:25:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:37,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:25:37,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:25:37,933 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:38,579 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2025-02-08 06:25:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:25:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 06:25:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:38,580 INFO L225 Difference]: With dead ends: 227 [2025-02-08 06:25:38,580 INFO L226 Difference]: Without dead ends: 204 [2025-02-08 06:25:38,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:25:38,581 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 177 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:38,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 625 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:25:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-08 06:25:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 183. [2025-02-08 06:25:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 182 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2025-02-08 06:25:38,585 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 36 [2025-02-08 06:25:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:38,586 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2025-02-08 06:25:38,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2025-02-08 06:25:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:25:38,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:38,586 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:38,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 06:25:38,586 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-08 06:25:38,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1523837775, now seen corresponding path program 1 times [2025-02-08 06:25:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-02-08 06:25:38,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:38,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:25:38,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:25:38,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:38,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-02-08 06:25:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443696481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208875853] [2025-02-08 06:25:38,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:38,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:38,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:38,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:38,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:25:39,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:25:39,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:25:39,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:39,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 06:25:39,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:39,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:25:39,125 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-08 06:25:39,168 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 15 treesize of output 1 [2025-02-08 06:25:39,249 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:39,249 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 34 treesize of output 33 [2025-02-08 06:25:39,322 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:39,322 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 34 treesize of output 33 [2025-02-08 06:25:39,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 06:25:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:39,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:39,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_916))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_917)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-02-08 06:25:39,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_916))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_917)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-02-08 06:25:39,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:39,633 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 38 treesize of output 31 [2025-02-08 06:25:39,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2025-02-08 06:25:39,650 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 171 treesize of output 163 [2025-02-08 06:25:39,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:39,660 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 163 treesize of output 159 [2025-02-08 06:25:41,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:41,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 174 treesize of output 872