./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:51:28,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:51:28,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:51:28,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:51:28,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:51:28,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:51:28,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:51:28,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:51:28,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:51:28,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:51:28,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:51:28,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:51:28,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:51:28,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:51:28,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:51:28,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:28,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:51:28,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:51:28,263 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/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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2025-03-08 22:51:28,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:51:28,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:51:28,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:51:28,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:51:28,476 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:51:28,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2025-03-08 22:51:29,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6bf5c4a/f3c074057efd4022b65fde5d53ee69f1/FLAGdaf5ace12 [2025-03-08 22:51:29,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:51:29,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2025-03-08 22:51:29,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6bf5c4a/f3c074057efd4022b65fde5d53ee69f1/FLAGdaf5ace12 [2025-03-08 22:51:30,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6bf5c4a/f3c074057efd4022b65fde5d53ee69f1 [2025-03-08 22:51:30,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:51:30,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:51:30,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:30,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:51:30,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:51:30,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3bbecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30, skipping insertion in model container [2025-03-08 22:51:30,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:51:30,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:30,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:51:30,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:30,483 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:51:30,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30 WrapperNode [2025-03-08 22:51:30,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:30,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:30,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:51:30,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:51:30,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,515 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2025-03-08 22:51:30,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:30,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:51:30,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:51:30,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:51:30,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,536 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2025-03-08 22:51:30,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:51:30,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:51:30,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:51:30,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:51:30,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (1/1) ... [2025-03-08 22:51:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:30,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:51:30,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:51:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:51:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:51:30,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:51:30,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:51:31,027 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2025-03-08 22:51:31,027 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:51:31,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:51:31,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:51:31,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:31 BoogieIcfgContainer [2025-03-08 22:51:31,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:51:31,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:51:31,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:51:31,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:51:31,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:30" (1/3) ... [2025-03-08 22:51:31,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b14200e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:31, skipping insertion in model container [2025-03-08 22:51:31,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:30" (2/3) ... [2025-03-08 22:51:31,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b14200e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:31, skipping insertion in model container [2025-03-08 22:51:31,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:31" (3/3) ... [2025-03-08 22:51:31,048 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2025-03-08 22:51:31,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:51:31,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_parent_ptr.i that has 1 procedures, 154 locations, 1 initial locations, 3 loop locations, and 77 error locations. [2025-03-08 22:51:31,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:51:31,107 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;@29ae9d26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:51:31,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-03-08 22:51:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 76 states have (on average 2.1842105263157894) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:51:31,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:31,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:51:31,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 197574, now seen corresponding path program 1 times [2025-03-08 22:51:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107196099] [2025-03-08 22:51:31,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:51:31,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:51:31,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:31,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107196099] [2025-03-08 22:51:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107196099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:31,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944203446] [2025-03-08 22:51:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:31,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:31,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:31,282 INFO L87 Difference]: Start difference. First operand has 154 states, 76 states have (on average 2.1842105263157894) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:31,417 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2025-03-08 22:51:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:31,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:51:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:31,423 INFO L225 Difference]: With dead ends: 151 [2025-03-08 22:51:31,423 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 22:51:31,425 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-03-08 22:51:31,426 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:31,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 134 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 22:51:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 22:51:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 75 states have (on average 2.12) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2025-03-08 22:51:31,453 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 3 [2025-03-08 22:51:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:31,454 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2025-03-08 22:51:31,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2025-03-08 22:51:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:51:31,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:31,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:51:31,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:51:31,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:31,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 197575, now seen corresponding path program 1 times [2025-03-08 22:51:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:31,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582463392] [2025-03-08 22:51:31,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:51:31,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:51:31,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:31,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582463392] [2025-03-08 22:51:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582463392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:31,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321869451] [2025-03-08 22:51:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:31,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:31,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:31,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:31,541 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:31,655 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2025-03-08 22:51:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:51:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:31,656 INFO L225 Difference]: With dead ends: 146 [2025-03-08 22:51:31,657 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 22:51:31,658 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-03-08 22:51:31,658 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 92 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 142 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:31,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 142 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 22:51:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-08 22:51:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 75 states have (on average 2.08) internal successors, (156), 145 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-03-08 22:51:31,670 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 3 [2025-03-08 22:51:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-03-08 22:51:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-03-08 22:51:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:51:31,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:31,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:51:31,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:31,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 29824725, now seen corresponding path program 1 times [2025-03-08 22:51:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:31,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-03-08 22:51:31,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:31,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:51:31,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:51:31,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:31,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-03-08 22:51:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443044832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881935147] [2025-03-08 22:51:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:31,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:31,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:31,757 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:31,913 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2025-03-08 22:51:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:51:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:31,914 INFO L225 Difference]: With dead ends: 150 [2025-03-08 22:51:31,914 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 22:51:31,914 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-03-08 22:51:31,914 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 174 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:31,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 119 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 22:51:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2025-03-08 22:51:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 76 states have (on average 1.855263157894737) internal successors, (141), 129 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-03-08 22:51:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-03-08 22:51:31,926 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 8 [2025-03-08 22:51:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:31,926 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-03-08 22:51:31,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-03-08 22:51:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:51:31,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:31,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:51:31,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 29824726, now seen corresponding path program 1 times [2025-03-08 22:51:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617573148] [2025-03-08 22:51:31,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:31,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:51:31,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:51:31,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:31,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617573148] [2025-03-08 22:51:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617573148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653866623] [2025-03-08 22:51:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:32,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:32,057 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:32,248 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2025-03-08 22:51:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:32,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:51:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:32,250 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:51:32,250 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 22:51:32,250 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-03-08 22:51:32,250 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 184 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:32,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 177 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 22:51:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2025-03-08 22:51:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.7232142857142858) internal successors, (193), 165 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2025-03-08 22:51:32,266 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 8 [2025-03-08 22:51:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:32,266 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2025-03-08 22:51:32,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2025-03-08 22:51:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:32,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:32,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:32,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:51:32,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 924562814, now seen corresponding path program 1 times [2025-03-08 22:51:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48092553] [2025-03-08 22:51:32,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:32,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:32,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48092553] [2025-03-08 22:51:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48092553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283490782] [2025-03-08 22:51:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:32,330 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:32,402 INFO L93 Difference]: Finished difference Result 166 states and 195 transitions. [2025-03-08 22:51:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:32,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:51:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:32,404 INFO L225 Difference]: With dead ends: 166 [2025-03-08 22:51:32,404 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 22:51:32,405 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-03-08 22:51:32,405 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:32,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 198 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 22:51:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-08 22:51:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.7105263157894737) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2025-03-08 22:51:32,413 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 9 [2025-03-08 22:51:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2025-03-08 22:51:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2025-03-08 22:51:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:32,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:32,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:32,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:51:32,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 924562815, now seen corresponding path program 1 times [2025-03-08 22:51:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642858535] [2025-03-08 22:51:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:32,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642858535] [2025-03-08 22:51:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642858535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126726668] [2025-03-08 22:51:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:32,501 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:32,603 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2025-03-08 22:51:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:51:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:32,604 INFO L225 Difference]: With dead ends: 164 [2025-03-08 22:51:32,604 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 22:51:32,604 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-03-08 22:51:32,605 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 187 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-03-08 22:51:32,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 187 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 22:51:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-08 22:51:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.6842105263157894) internal successors, (192), 163 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2025-03-08 22:51:32,614 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 9 [2025-03-08 22:51:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2025-03-08 22:51:32,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2025-03-08 22:51:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:51:32,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:32,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:32,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:51:32,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash 25545784, now seen corresponding path program 1 times [2025-03-08 22:51:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265923045] [2025-03-08 22:51:32,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:32,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:51:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:51:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265923045] [2025-03-08 22:51:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265923045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455602316] [2025-03-08 22:51:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:32,656 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:32,670 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2025-03-08 22:51:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:51:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:32,671 INFO L225 Difference]: With dead ends: 164 [2025-03-08 22:51:32,672 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 22:51:32,672 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-03-08 22:51:32,672 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 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-03-08 22:51:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 22:51:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-08 22:51:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.6754385964912282) internal successors, (191), 163 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2025-03-08 22:51:32,679 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 12 [2025-03-08 22:51:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:32,679 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2025-03-08 22:51:32,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2025-03-08 22:51:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:32,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:32,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:51:32,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:32,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1218736363, now seen corresponding path program 1 times [2025-03-08 22:51:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220196870] [2025-03-08 22:51:32,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:32,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:32,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220196870] [2025-03-08 22:51:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220196870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029921735] [2025-03-08 22:51:32,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:32,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:32,737 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:32,846 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2025-03-08 22:51:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:51:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:32,847 INFO L225 Difference]: With dead ends: 171 [2025-03-08 22:51:32,847 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 22:51:32,847 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-03-08 22:51:32,848 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:32,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 248 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 22:51:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2025-03-08 22:51:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.6293103448275863) internal successors, (189), 160 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-03-08 22:51:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2025-03-08 22:51:32,851 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 14 [2025-03-08 22:51:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:32,858 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2025-03-08 22:51:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2025-03-08 22:51:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:32,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:32,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:32,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:51:32,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1218736362, now seen corresponding path program 1 times [2025-03-08 22:51:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833868022] [2025-03-08 22:51:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:32,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:32,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:32,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833868022] [2025-03-08 22:51:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833868022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:32,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:32,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199304186] [2025-03-08 22:51:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:32,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:32,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:32,951 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:33,085 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2025-03-08 22:51:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:51:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:33,086 INFO L225 Difference]: With dead ends: 173 [2025-03-08 22:51:33,086 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 22:51:33,086 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-03-08 22:51:33,086 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:33,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 222 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 22:51:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-08 22:51:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 167 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2025-03-08 22:51:33,089 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 14 [2025-03-08 22:51:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:33,089 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2025-03-08 22:51:33,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2025-03-08 22:51:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:51:33,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:33,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:33,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:51:33,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:33,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1197416723, now seen corresponding path program 1 times [2025-03-08 22:51:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646638078] [2025-03-08 22:51:33,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:33,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:51:33,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:51:33,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:33,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646638078] [2025-03-08 22:51:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646638078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:33,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090642566] [2025-03-08 22:51:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:33,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:33,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:33,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:33,118 INFO L87 Difference]: Start difference. First operand 168 states and 202 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-03-08 22:51:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:33,125 INFO L93 Difference]: Finished difference Result 170 states and 204 transitions. [2025-03-08 22:51:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:33,125 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-03-08 22:51:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:33,126 INFO L225 Difference]: With dead ends: 170 [2025-03-08 22:51:33,126 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 22:51:33,126 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-03-08 22:51:33,127 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 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-03-08 22:51:33,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 22:51:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-08 22:51:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.5813953488372092) internal successors, (204), 169 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2025-03-08 22:51:33,130 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 15 [2025-03-08 22:51:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2025-03-08 22:51:33,131 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-03-08 22:51:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2025-03-08 22:51:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:33,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:33,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:33,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:51:33,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:33,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2016421223, now seen corresponding path program 1 times [2025-03-08 22:51:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830822309] [2025-03-08 22:51:33,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:33,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:33,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:33,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:33,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830822309] [2025-03-08 22:51:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830822309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355951569] [2025-03-08 22:51:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:33,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:33,193 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-08 22:51:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:33,256 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2025-03-08 22:51:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-08 22:51:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:33,257 INFO L225 Difference]: With dead ends: 176 [2025-03-08 22:51:33,257 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 22:51:33,257 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-03-08 22:51:33,258 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:33,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 328 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 22:51:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-03-08 22:51:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2025-03-08 22:51:33,260 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 17 [2025-03-08 22:51:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:33,260 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2025-03-08 22:51:33,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-08 22:51:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2025-03-08 22:51:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:33,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:33,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:33,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:51:33,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:33,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash 663438415, now seen corresponding path program 1 times [2025-03-08 22:51:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:33,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501020535] [2025-03-08 22:51:33,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:33,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:33,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:33,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501020535] [2025-03-08 22:51:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501020535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:33,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:51:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981433366] [2025-03-08 22:51:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:33,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:33,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:33,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:33,425 INFO L87 Difference]: Start difference. First operand 171 states and 205 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-03-08 22:51:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:33,573 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2025-03-08 22:51:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:51:33,573 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-03-08 22:51:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:33,574 INFO L225 Difference]: With dead ends: 210 [2025-03-08 22:51:33,574 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 22:51:33,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:33,574 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:33,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 472 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 22:51:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 185. [2025-03-08 22:51:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 184 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-03-08 22:51:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2025-03-08 22:51:33,577 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 17 [2025-03-08 22:51:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:33,578 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2025-03-08 22:51:33,578 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-03-08 22:51:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2025-03-08 22:51:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:33,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:33,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:33,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:51:33,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash -750544490, now seen corresponding path program 1 times [2025-03-08 22:51:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314338333] [2025-03-08 22:51:33,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:33,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314338333] [2025-03-08 22:51:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314338333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:33,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:33,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:51:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805383011] [2025-03-08 22:51:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:51:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:33,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:51:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:51:33,913 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:34,345 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2025-03-08 22:51:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:51:34,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:34,348 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:51:34,348 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 22:51:34,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:51:34,348 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:34,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 314 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 22:51:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 190. [2025-03-08 22:51:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.5436241610738255) internal successors, (230), 189 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-03-08 22:51:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 230 transitions. [2025-03-08 22:51:34,353 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 230 transitions. Word has length 19 [2025-03-08 22:51:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:34,354 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 230 transitions. [2025-03-08 22:51:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 230 transitions. [2025-03-08 22:51:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:34,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:34,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:51:34,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -750544489, now seen corresponding path program 1 times [2025-03-08 22:51:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635984885] [2025-03-08 22:51:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:34,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:34,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635984885] [2025-03-08 22:51:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635984885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:34,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:34,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538458250] [2025-03-08 22:51:34,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:34,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:34,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:34,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:34,706 INFO L87 Difference]: Start difference. First operand 190 states and 230 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,172 INFO L93 Difference]: Finished difference Result 212 states and 245 transitions. [2025-03-08 22:51:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:51:35,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,173 INFO L225 Difference]: With dead ends: 212 [2025-03-08 22:51:35,174 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 22:51:35,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:35,174 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 191 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 382 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:51:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 22:51:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2025-03-08 22:51:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 153 states have (on average 1.5359477124183007) internal successors, (235), 193 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2025-03-08 22:51:35,178 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 19 [2025-03-08 22:51:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,178 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2025-03-08 22:51:35,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2025-03-08 22:51:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:35,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:51:35,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 779414324, now seen corresponding path program 1 times [2025-03-08 22:51:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970509086] [2025-03-08 22:51:35,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:35,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:35,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970509086] [2025-03-08 22:51:35,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970509086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696560403] [2025-03-08 22:51:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:35,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:35,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:35,299 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,443 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2025-03-08 22:51:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,445 INFO L225 Difference]: With dead ends: 193 [2025-03-08 22:51:35,445 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 22:51:35,445 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-03-08 22:51:35,446 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 276 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 22:51:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-08 22:51:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 153 states have (on average 1.522875816993464) internal successors, (233), 192 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-03-08 22:51:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2025-03-08 22:51:35,451 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 19 [2025-03-08 22:51:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,451 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2025-03-08 22:51:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2025-03-08 22:51:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:35,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:35,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:51:35,453 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 779414323, now seen corresponding path program 1 times [2025-03-08 22:51:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788247561] [2025-03-08 22:51:35,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:35,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:35,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788247561] [2025-03-08 22:51:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788247561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087948331] [2025-03-08 22:51:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:35,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:35,520 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,636 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2025-03-08 22:51:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:35,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,638 INFO L225 Difference]: With dead ends: 192 [2025-03-08 22:51:35,638 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 22:51:35,638 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-03-08 22:51:35,638 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 22:51:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-08 22:51:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 191 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-03-08 22:51:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2025-03-08 22:51:35,642 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 19 [2025-03-08 22:51:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2025-03-08 22:51:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2025-03-08 22:51:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:51:35,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,644 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-03-08 22:51:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:51:35,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash 128846253, now seen corresponding path program 1 times [2025-03-08 22:51:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700892265] [2025-03-08 22:51:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:51:35,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:51:35,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700892265] [2025-03-08 22:51:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700892265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537982134] [2025-03-08 22:51:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:35,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:35,726 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-03-08 22:51:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,818 INFO L93 Difference]: Finished difference Result 197 states and 238 transitions. [2025-03-08 22:51:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-03-08 22:51:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,820 INFO L225 Difference]: With dead ends: 197 [2025-03-08 22:51:35,820 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 22:51:35,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:35,820 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 135 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 86 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 22:51:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2025-03-08 22:51:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 183 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2025-03-08 22:51:35,824 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 22 [2025-03-08 22:51:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,824 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2025-03-08 22:51:35,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-03-08 22:51:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2025-03-08 22:51:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:51:35,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,824 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-03-08 22:51:35,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:51:35,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash 938972665, now seen corresponding path program 1 times [2025-03-08 22:51:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737854140] [2025-03-08 22:51:35,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:51:35,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:51:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:35,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737854140] [2025-03-08 22:51:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737854140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:51:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040306462] [2025-03-08 22:51:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:51:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:51:35,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:35,963 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,198 INFO L93 Difference]: Finished difference Result 195 states and 235 transitions. [2025-03-08 22:51:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:51:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,199 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:51:36,199 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:51:36,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:36,200 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 245 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:51:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2025-03-08 22:51:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 182 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 221 transitions. [2025-03-08 22:51:36,203 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 221 transitions. Word has length 22 [2025-03-08 22:51:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 221 transitions. [2025-03-08 22:51:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 221 transitions. [2025-03-08 22:51:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:51:36,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,206 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-03-08 22:51:36,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:51:36,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 938972666, now seen corresponding path program 1 times [2025-03-08 22:51:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830651494] [2025-03-08 22:51:36,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:51:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:51:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830651494] [2025-03-08 22:51:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830651494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:51:36,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471488114] [2025-03-08 22:51:36,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:51:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:51:36,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:36,391 INFO L87 Difference]: Start difference. First operand 183 states and 221 transitions. Second operand has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,672 INFO L93 Difference]: Finished difference Result 194 states and 233 transitions. [2025-03-08 22:51:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:51:36,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,673 INFO L225 Difference]: With dead ends: 194 [2025-03-08 22:51:36,674 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 22:51:36,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:36,674 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 134 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 281 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 22:51:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-03-08 22:51:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 181 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 219 transitions. [2025-03-08 22:51:36,677 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 219 transitions. Word has length 22 [2025-03-08 22:51:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,677 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 219 transitions. [2025-03-08 22:51:36,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) 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-03-08 22:51:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 219 transitions. [2025-03-08 22:51:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:51:36,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,678 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] [2025-03-08 22:51:36,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:51:36,678 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -511554735, now seen corresponding path program 1 times [2025-03-08 22:51:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302922197] [2025-03-08 22:51:36,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:51:36,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:51:36,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:36,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302922197] [2025-03-08 22:51:36,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302922197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222623695] [2025-03-08 22:51:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:36,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:36,747 INFO L87 Difference]: Start difference. First operand 182 states and 219 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,854 INFO L93 Difference]: Finished difference Result 181 states and 217 transitions. [2025-03-08 22:51:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 22:51:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,856 INFO L225 Difference]: With dead ends: 181 [2025-03-08 22:51:36,856 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 22:51:36,856 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-03-08 22:51:36,856 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 267 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 22:51:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 22:51:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 180 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2025-03-08 22:51:36,861 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 23 [2025-03-08 22:51:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2025-03-08 22:51:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2025-03-08 22:51:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:51:36,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,862 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] [2025-03-08 22:51:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:51:36,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -511554734, now seen corresponding path program 1 times [2025-03-08 22:51:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843758797] [2025-03-08 22:51:36,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:51:36,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:51:36,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843758797] [2025-03-08 22:51:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843758797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166597384] [2025-03-08 22:51:36,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:36,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:36,960 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:37,092 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2025-03-08 22:51:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:37,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 22:51:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:37,093 INFO L225 Difference]: With dead ends: 180 [2025-03-08 22:51:37,093 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 22:51:37,093 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-03-08 22:51:37,094 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:37,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 259 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 22:51:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 22:51:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 179 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 215 transitions. [2025-03-08 22:51:37,099 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 215 transitions. Word has length 23 [2025-03-08 22:51:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 215 transitions. [2025-03-08 22:51:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 215 transitions. [2025-03-08 22:51:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:51:37,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:37,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:37,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:51:37,100 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -732186868, now seen corresponding path program 1 times [2025-03-08 22:51:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:37,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990476433] [2025-03-08 22:51:37,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:37,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:37,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:37,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990476433] [2025-03-08 22:51:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990476433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:37,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090347119] [2025-03-08 22:51:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:37,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:37,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:37,167 INFO L87 Difference]: Start difference. First operand 180 states and 215 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:37,296 INFO L93 Difference]: Finished difference Result 220 states and 263 transitions. [2025-03-08 22:51:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:37,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:51:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:37,297 INFO L225 Difference]: With dead ends: 220 [2025-03-08 22:51:37,297 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 22:51:37,298 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-03-08 22:51:37,299 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:37,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 136 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 22:51:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 158. [2025-03-08 22:51:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 136 states have (on average 1.375) internal successors, (187), 157 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2025-03-08 22:51:37,303 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 24 [2025-03-08 22:51:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:37,304 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2025-03-08 22:51:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2025-03-08 22:51:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:51:37,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:37,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:37,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:51:37,305 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -732186195, now seen corresponding path program 1 times [2025-03-08 22:51:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626626653] [2025-03-08 22:51:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:37,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:37,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:37,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626626653] [2025-03-08 22:51:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626626653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039098488] [2025-03-08 22:51:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:37,473 INFO L87 Difference]: Start difference. First operand 158 states and 187 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:37,826 INFO L93 Difference]: Finished difference Result 224 states and 263 transitions. [2025-03-08 22:51:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:51:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:51:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:37,827 INFO L225 Difference]: With dead ends: 224 [2025-03-08 22:51:37,827 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 22:51:37,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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-03-08 22:51:37,828 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 179 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:37,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 450 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 22:51:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 171. [2025-03-08 22:51:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 170 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2025-03-08 22:51:37,831 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 24 [2025-03-08 22:51:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:37,831 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2025-03-08 22:51:37,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2025-03-08 22:51:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:51:37,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:37,832 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-03-08 22:51:37,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:51:37,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:37,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1242073298, now seen corresponding path program 1 times [2025-03-08 22:51:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240440125] [2025-03-08 22:51:37,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:37,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:51:37,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:51:37,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240440125] [2025-03-08 22:51:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240440125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:51:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439888942] [2025-03-08 22:51:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:51:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:51:38,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:38,281 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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-03-08 22:51:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:38,795 INFO L93 Difference]: Finished difference Result 223 states and 261 transitions. [2025-03-08 22:51:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:51:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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-03-08 22:51:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:38,796 INFO L225 Difference]: With dead ends: 223 [2025-03-08 22:51:38,797 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 22:51:38,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:51:38,798 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 242 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:38,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 286 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 22:51:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 171. [2025-03-08 22:51:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.348993288590604) internal successors, (201), 170 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2025-03-08 22:51:38,801 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 25 [2025-03-08 22:51:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2025-03-08 22:51:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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-03-08 22:51:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2025-03-08 22:51:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:51:38,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:38,801 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-03-08 22:51:38,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:51:38,802 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -187264436, now seen corresponding path program 1 times [2025-03-08 22:51:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124950446] [2025-03-08 22:51:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:51:38,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:51:38,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124950446] [2025-03-08 22:51:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124950446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720669267] [2025-03-08 22:51:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:38,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:38,960 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,254 INFO L93 Difference]: Finished difference Result 195 states and 230 transitions. [2025-03-08 22:51:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:51:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,255 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:51:39,255 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:51:39,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:51:39,255 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 135 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 365 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:51:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 170. [2025-03-08 22:51:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 169 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2025-03-08 22:51:39,259 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 25 [2025-03-08 22:51:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2025-03-08 22:51:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2025-03-08 22:51:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:51:39,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,259 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-03-08 22:51:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:51:39,259 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -187264435, now seen corresponding path program 1 times [2025-03-08 22:51:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794661407] [2025-03-08 22:51:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:51:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:51:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794661407] [2025-03-08 22:51:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794661407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170682366] [2025-03-08 22:51:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:39,477 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,703 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2025-03-08 22:51:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:51:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,704 INFO L225 Difference]: With dead ends: 181 [2025-03-08 22:51:39,704 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 22:51:39,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:39,705 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 121 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 238 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 22:51:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2025-03-08 22:51:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 149 states have (on average 1.3221476510067114) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2025-03-08 22:51:39,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 25 [2025-03-08 22:51:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,708 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-03-08 22:51:39,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-03-08 22:51:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2025-03-08 22:51:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:51:39,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,708 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] [2025-03-08 22:51:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:51:39,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1183098598, now seen corresponding path program 1 times [2025-03-08 22:51:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5703440] [2025-03-08 22:51:39,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:51:39,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:51:39,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5703440] [2025-03-08 22:51:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5703440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:51:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984245378] [2025-03-08 22:51:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:51:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:51:39,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:39,826 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:40,053 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2025-03-08 22:51:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:51:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 22:51:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:40,054 INFO L225 Difference]: With dead ends: 180 [2025-03-08 22:51:40,054 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 22:51:40,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:40,054 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 115 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:40,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 275 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 22:51:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2025-03-08 22:51:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.3154362416107384) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2025-03-08 22:51:40,057 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 26 [2025-03-08 22:51:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:40,057 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2025-03-08 22:51:40,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2025-03-08 22:51:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:51:40,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:40,058 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] [2025-03-08 22:51:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:51:40,058 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1183098597, now seen corresponding path program 1 times [2025-03-08 22:51:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077776691] [2025-03-08 22:51:40,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:40,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:51:40,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:51:40,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077776691] [2025-03-08 22:51:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077776691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:51:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610677756] [2025-03-08 22:51:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:51:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:40,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:51:40,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:40,234 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:40,505 INFO L93 Difference]: Finished difference Result 179 states and 209 transitions. [2025-03-08 22:51:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:51:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 22:51:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:40,506 INFO L225 Difference]: With dead ends: 179 [2025-03-08 22:51:40,506 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 22:51:40,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:40,507 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 112 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:40,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 321 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 22:51:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2025-03-08 22:51:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.308724832214765) internal successors, (195), 166 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2025-03-08 22:51:40,510 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 26 [2025-03-08 22:51:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2025-03-08 22:51:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2025-03-08 22:51:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:51:40,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:40,511 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] [2025-03-08 22:51:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:51:40,511 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1579935286, now seen corresponding path program 1 times [2025-03-08 22:51:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986600634] [2025-03-08 22:51:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:40,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:40,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:40,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986600634] [2025-03-08 22:51:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986600634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659283985] [2025-03-08 22:51:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:40,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:40,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:51:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 22:51:40,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:41,038 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-03-08 22:51:41,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:41,108 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-03-08 22:51:41,240 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:51:41,240 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-03-08 22:51:41,319 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-08 22:51:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2025-03-08 22:51:41,333 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~st~0#1.base_28| Int) (|v_ULTIMATE.start_main_~n~0#1.base_84| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_84|) 0) (= (select |c_#valid| |v_ULTIMATE.start_main_~st~0#1.base_28|) 0) (= (store (store |c_#valid| |v_ULTIMATE.start_main_~st~0#1.base_28| 0) |v_ULTIMATE.start_main_~n~0#1.base_84| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from true [2025-03-08 22:51:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 22:51:41,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:41,431 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 14 treesize of output 12 [2025-03-08 22:51:41,434 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 22 treesize of output 20 [2025-03-08 22:51:41,444 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 35 treesize of output 31 [2025-03-08 22:51:41,448 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 48 treesize of output 44 [2025-03-08 22:51:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659283985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:50,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 24 [2025-03-08 22:51:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097991668] [2025-03-08 22:51:50,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:50,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:51:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:50,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:51:50,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=482, Unknown=3, NotChecked=44, Total=600 [2025-03-08 22:51:50,194 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:50,931 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2025-03-08 22:51:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:51:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 22:51:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:50,932 INFO L225 Difference]: With dead ends: 211 [2025-03-08 22:51:50,932 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 22:51:50,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=109, Invalid=762, Unknown=3, NotChecked=56, Total=930 [2025-03-08 22:51:50,933 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 85 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:50,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 625 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 849 Invalid, 0 Unknown, 167 Unchecked, 0.6s Time] [2025-03-08 22:51:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 22:51:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2025-03-08 22:51:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 185 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-03-08 22:51:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2025-03-08 22:51:50,935 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 27 [2025-03-08 22:51:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:50,936 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2025-03-08 22:51:50,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2025-03-08 22:51:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:51:50,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:50,936 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] [2025-03-08 22:51:50,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:51:51,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:51:51,137 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:51,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1579936918, now seen corresponding path program 1 times [2025-03-08 22:51:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547249315] [2025-03-08 22:51:51,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:51,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:51,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:51,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547249315] [2025-03-08 22:51:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547249315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105452435] [2025-03-08 22:51:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:51,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:51,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:51:51,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:51,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:51:51,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:51,362 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-03-08 22:51:51,364 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-03-08 22:51:51,370 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-03-08 22:51:51,375 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-03-08 22:51:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105452435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:51,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 22:51:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739787074] [2025-03-08 22:51:51,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:51,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:51,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:51,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:51,460 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:51,521 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2025-03-08 22:51:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-08 22:51:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:51,522 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:51:51,522 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:51:51,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-03-08 22:51:51,523 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:51,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 341 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:51:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2025-03-08 22:51:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 166 states have (on average 1.283132530120482) internal successors, (213), 183 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2025-03-08 22:51:51,526 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 27 [2025-03-08 22:51:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:51,526 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2025-03-08 22:51:51,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2025-03-08 22:51:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:51:51,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:51,527 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-03-08 22:51:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:51,727 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1188663414, now seen corresponding path program 1 times [2025-03-08 22:51:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008869682] [2025-03-08 22:51:51,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:51,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:51:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008869682] [2025-03-08 22:51:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008869682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552664719] [2025-03-08 22:51:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:51,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:51,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:51,901 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:52,193 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2025-03-08 22:51:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:51:52,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:52,194 INFO L225 Difference]: With dead ends: 203 [2025-03-08 22:51:52,194 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 22:51:52,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:52,195 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 113 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:52,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 311 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 22:51:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2025-03-08 22:51:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 182 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2025-03-08 22:51:52,197 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 29 [2025-03-08 22:51:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:52,197 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2025-03-08 22:51:52,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2025-03-08 22:51:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:51:52,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:52,198 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-03-08 22:51:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:51:52,198 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1188663413, now seen corresponding path program 1 times [2025-03-08 22:51:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799191585] [2025-03-08 22:51:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:52,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:51:52,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:52,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799191585] [2025-03-08 22:51:52,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799191585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:52,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:52,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:52,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757129362] [2025-03-08 22:51:52,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:52,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:52,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:52,432 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:52,695 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2025-03-08 22:51:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:51:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:52,696 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:51:52,696 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 22:51:52,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:52,697 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 109 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:52,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 236 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 22:51:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2025-03-08 22:51:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.2710843373493976) internal successors, (211), 181 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-03-08 22:51:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2025-03-08 22:51:52,701 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 29 [2025-03-08 22:51:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2025-03-08 22:51:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-03-08 22:51:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2025-03-08 22:51:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:52,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:52,701 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, 1, 1] [2025-03-08 22:51:52,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:51:52,702 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1646112987, now seen corresponding path program 1 times [2025-03-08 22:51:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:52,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176008727] [2025-03-08 22:51:52,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:52,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176008727] [2025-03-08 22:51:52,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176008727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:52,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:52,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661769272] [2025-03-08 22:51:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:52,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:52,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:52,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:52,731 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 4 states, 4 states have (on average 7.75) 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-03-08 22:51:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:52,770 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2025-03-08 22:51:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) 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-03-08 22:51:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:52,771 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:51:52,771 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:51:52,771 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-03-08 22:51:52,771 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 17 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 256 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-03-08 22:51:52,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 256 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:51:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2025-03-08 22:51:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 181 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2025-03-08 22:51:52,774 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 31 [2025-03-08 22:51:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:52,774 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2025-03-08 22:51:52,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) 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-03-08 22:51:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2025-03-08 22:51:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:52,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:52,774 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:52,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:51:52,775 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1646114619, now seen corresponding path program 1 times [2025-03-08 22:51:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828073734] [2025-03-08 22:51:52,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:52,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:52,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:52,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828073734] [2025-03-08 22:51:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828073734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:52,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17209205] [2025-03-08 22:51:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:52,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:52,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:52,851 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-03-08 22:51:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:53,033 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2025-03-08 22:51:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:53,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-03-08 22:51:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:53,034 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:51:53,034 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:51:53,034 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-03-08 22:51:53,035 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 78 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:53,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 196 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:51:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 182. [2025-03-08 22:51:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.2590361445783131) internal successors, (209), 181 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2025-03-08 22:51:53,038 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 31 [2025-03-08 22:51:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2025-03-08 22:51:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-03-08 22:51:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2025-03-08 22:51:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:51:53,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:53,038 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, 1, 1] [2025-03-08 22:51:53,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:51:53,039 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:53,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1368184568, now seen corresponding path program 1 times [2025-03-08 22:51:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:53,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394402909] [2025-03-08 22:51:53,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:51:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394402909] [2025-03-08 22:51:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394402909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888509874] [2025-03-08 22:51:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:53,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:53,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:53,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:53,078 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:53,156 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2025-03-08 22:51:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 22:51:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:53,157 INFO L225 Difference]: With dead ends: 181 [2025-03-08 22:51:53,157 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 22:51:53,157 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-03-08 22:51:53,158 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:53,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 168 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 22:51:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 22:51:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 180 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2025-03-08 22:51:53,160 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 33 [2025-03-08 22:51:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:53,161 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2025-03-08 22:51:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2025-03-08 22:51:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:51:53,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:53,161 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, 1, 1] [2025-03-08 22:51:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:51:53,162 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1692219501, now seen corresponding path program 1 times [2025-03-08 22:51:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029968807] [2025-03-08 22:51:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:51:53,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:51:53,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029968807] [2025-03-08 22:51:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029968807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:51:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090743370] [2025-03-08 22:51:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:51:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:53,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:51:53,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:53,563 INFO L87 Difference]: Start difference. First operand 181 states and 207 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:54,071 INFO L93 Difference]: Finished difference Result 214 states and 241 transitions. [2025-03-08 22:51:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:51:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 22:51:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:54,072 INFO L225 Difference]: With dead ends: 214 [2025-03-08 22:51:54,072 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 22:51:54,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:51:54,072 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 126 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:54,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 550 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 22:51:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2025-03-08 22:51:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 166 states have (on average 1.2409638554216869) internal successors, (206), 180 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-03-08 22:51:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 206 transitions. [2025-03-08 22:51:54,079 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 206 transitions. Word has length 38 [2025-03-08 22:51:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:54,079 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 206 transitions. [2025-03-08 22:51:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 206 transitions. [2025-03-08 22:51:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:51:54,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:54,080 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, 1, 1] [2025-03-08 22:51:54,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:51:54,081 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:54,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash 644495123, now seen corresponding path program 1 times [2025-03-08 22:51:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935343897] [2025-03-08 22:51:54,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:54,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:51:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:51:54,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:54,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935343897] [2025-03-08 22:51:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935343897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 22:51:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394106948] [2025-03-08 22:51:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:51:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:54,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:51:54,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:54,582 INFO L87 Difference]: Start difference. First operand 181 states and 206 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:55,085 INFO L93 Difference]: Finished difference Result 202 states and 227 transitions. [2025-03-08 22:51:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:51:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 22:51:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:55,087 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:51:55,087 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 22:51:55,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:51:55,087 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 237 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:55,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 458 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 22:51:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2025-03-08 22:51:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 165 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2025-03-08 22:51:55,090 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 38 [2025-03-08 22:51:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:55,090 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2025-03-08 22:51:55,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2025-03-08 22:51:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:51:55,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:55,091 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 22:51:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:51:55,091 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:55,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -299089441, now seen corresponding path program 1 times [2025-03-08 22:51:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463276437] [2025-03-08 22:51:55,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:55,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:51:55,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:51:55,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463276437] [2025-03-08 22:51:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463276437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537582405] [2025-03-08 22:51:55,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:55,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:51:55,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:51:55,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:51:55,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:55,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 22:51:55,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:55,562 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:55,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:51:55,586 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-03-08 22:51:55,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:55,643 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 25 treesize of output 26 [2025-03-08 22:51:55,683 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:55,684 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 25 treesize of output 26 [2025-03-08 22:51:55,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:55,716 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-03-08 22:51:55,782 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-03-08 22:51:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:55,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:55,815 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-03-08 22:51:55,815 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 19 treesize of output 18 [2025-03-08 22:51:55,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base| v_ArrVal_1417) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem17#1.base|)) is different from false [2025-03-08 22:51:55,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1416))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1417) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-03-08 22:51:55,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (let ((.cse1 (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_1416))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1417) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-03-08 22:51:55,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1416)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1417) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-03-08 22:51:55,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int))) (let ((.cse0 (let ((.cse2 (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_1415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1416)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1417) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1)))) is different from false [2025-03-08 22:51:55,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:55,879 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 105 treesize of output 66 [2025-03-08 22:51:55,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:55,893 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 1596 treesize of output 1335 [2025-03-08 22:51:55,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:55,919 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 230 treesize of output 203 [2025-03-08 22:51:55,925 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 218 treesize of output 204 [2025-03-08 22:51:55,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:55,936 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 182 treesize of output 159 [2025-03-08 22:51:56,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:56,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-03-08 22:51:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537582405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:56,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 28 [2025-03-08 22:51:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045811634] [2025-03-08 22:51:56,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 22:51:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:56,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 22:51:56,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=459, Unknown=7, NotChecked=240, Total=812 [2025-03-08 22:51:56,248 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:56,968 INFO L93 Difference]: Finished difference Result 282 states and 333 transitions. [2025-03-08 22:51:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:51:56,968 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 22:51:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:56,969 INFO L225 Difference]: With dead ends: 282 [2025-03-08 22:51:56,969 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 22:51:56,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=891, Unknown=7, NotChecked=340, Total=1482 [2025-03-08 22:51:56,970 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 341 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:56,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 906 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 938 Invalid, 0 Unknown, 1104 Unchecked, 0.5s Time] [2025-03-08 22:51:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 22:51:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 225. [2025-03-08 22:51:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 224 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 272 transitions. [2025-03-08 22:51:56,974 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 272 transitions. Word has length 42 [2025-03-08 22:51:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 272 transitions. [2025-03-08 22:51:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 272 transitions. [2025-03-08 22:51:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:51:56,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:56,975 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 22:51:56,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:51:57,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:57,175 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:51:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash -299089440, now seen corresponding path program 1 times [2025-03-08 22:51:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:57,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814471027] [2025-03-08 22:51:57,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:57,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:51:57,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:51:57,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:57,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:57,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814471027] [2025-03-08 22:51:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814471027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:57,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202690021] [2025-03-08 22:51:57,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:57,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:57,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:57,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:51:57,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:51:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:51:57,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:57,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:57,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 22:51:57,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:57,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:51:57,796 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2025-03-08 22:51:57,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 24 [2025-03-08 22:51:57,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:51:57,843 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-03-08 22:51:57,962 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 22:51:57,963 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 52 treesize of output 34 [2025-03-08 22:51:57,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 22:51:58,092 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2025-03-08 22:51:58,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 42 [2025-03-08 22:51:58,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 22:51:58,206 INFO L349 Elim1Store]: treesize reduction 22, result has 31.3 percent of original size [2025-03-08 22:51:58,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 61 [2025-03-08 22:51:58,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 22:51:58,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:58,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-08 22:51:58,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-08 22:51:58,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:51:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:58,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:58,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:58,541 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 40 treesize of output 44 [2025-03-08 22:51:59,592 INFO L349 Elim1Store]: treesize reduction 79, result has 50.9 percent of original size [2025-03-08 22:51:59,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 587 treesize of output 511 [2025-03-08 22:51:59,719 INFO L349 Elim1Store]: treesize reduction 173, result has 24.1 percent of original size [2025-03-08 22:51:59,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 3557 treesize of output 3535 [2025-03-08 22:51:59,826 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 6 treesize of output 4 [2025-03-08 22:52:00,116 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:01,362 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:01,410 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2025-03-08 22:52:01,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2264 treesize of output 2252 [2025-03-08 22:52:01,434 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 659 treesize of output 639 [2025-03-08 22:52:01,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 570 treesize of output 589 [2025-03-08 22:52:01,481 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 560 treesize of output 558 [2025-03-08 22:52:01,497 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 558 treesize of output 556 [2025-03-08 22:52:01,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,521 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 556 treesize of output 561 [2025-03-08 22:52:01,537 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 550 treesize of output 548 [2025-03-08 22:52:01,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,562 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 548 treesize of output 553 [2025-03-08 22:52:01,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,614 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 542 treesize of output 547 [2025-03-08 22:52:01,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 538 treesize of output 559 [2025-03-08 22:52:01,679 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 530 treesize of output 528 [2025-03-08 22:52:01,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,709 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 528 treesize of output 533 [2025-03-08 22:52:01,728 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 522 treesize of output 520 [2025-03-08 22:52:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:01,760 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 520 treesize of output 525 [2025-03-08 22:52:01,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 22:52:01,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 22:52:01,856 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 22:52:01,857 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 15 treesize of output 9 [2025-03-08 22:52:01,910 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 6 treesize of output 4 [2025-03-08 22:52:01,959 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 6 treesize of output 4 [2025-03-08 22:52:02,025 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 22:52:02,025 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 15 treesize of output 9 [2025-03-08 22:52:02,196 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 6 treesize of output 4 [2025-03-08 22:52:02,235 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 22:52:02,236 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 15 treesize of output 9 [2025-03-08 22:52:02,273 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 22:52:02,273 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 15 treesize of output 9 [2025-03-08 22:52:02,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:02,484 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 16 treesize of output 20 [2025-03-08 22:52:02,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 22:52:02,507 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:52:02,507 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 12 treesize of output 11 [2025-03-08 22:52:02,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:02,518 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 16 treesize of output 20 [2025-03-08 22:52:02,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:02,531 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 37 treesize of output 41 [2025-03-08 22:52:02,543 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 6 treesize of output 4 [2025-03-08 22:52:02,639 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-08 22:52:02,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4132 treesize of output 4076 [2025-03-08 22:52:02,748 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 1818 treesize of output 1768 [2025-03-08 22:52:02,815 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 1648 treesize of output 1646 [2025-03-08 22:52:02,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:02,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1646 treesize of output 1667 [2025-03-08 22:52:03,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:03,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1638 treesize of output 1659 [2025-03-08 22:52:03,082 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 1630 treesize of output 1628 [2025-03-08 22:52:03,429 INFO L349 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2025-03-08 22:52:03,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 77 [2025-03-08 22:52:03,520 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:03,558 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-08 22:52:03,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 16 [2025-03-08 22:52:03,630 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-03-08 22:52:03,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2025-03-08 22:52:03,654 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 22:52:03,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 1 [2025-03-08 22:52:03,696 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-03-08 22:52:03,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 102 [2025-03-08 22:52:03,795 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 8 treesize of output 4 [2025-03-08 22:52:03,818 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 8 treesize of output 4 [2025-03-08 22:52:03,831 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:03,841 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-03-08 22:52:03,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 58 [2025-03-08 22:52:03,906 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:03,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 22:52:04,020 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:04,023 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 22:52:04,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 1 [2025-03-08 22:52:04,030 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:04,049 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:04,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 22:52:04,059 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:04,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:04,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 22:52:04,170 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:04,189 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:52:04,194 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 22:52:04,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2025-03-08 22:52:04,208 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 22:52:04,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:04,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 148 [2025-03-08 22:52:04,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:04,601 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 270 treesize of output 258 [2025-03-08 22:52:04,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:04,902 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 218 treesize of output 211 [2025-03-08 22:52:04,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:52:04,934 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:52:04,934 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 1493 treesize of output 1296 [2025-03-08 22:52:04,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 503 [2025-03-08 22:52:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 205 [2025-03-08 22:52:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 439 [2025-03-08 22:52:05,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:05,039 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 170 treesize of output 171 [2025-03-08 22:52:05,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:52:05,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:52:05,054 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 438 [2025-03-08 22:52:05,068 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 364 treesize of output 342 [2025-03-08 22:52:05,074 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 342 treesize of output 338 [2025-03-08 22:52:05,080 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 338 treesize of output 332 [2025-03-08 22:52:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202690021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:52:05,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:52:05,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2025-03-08 22:52:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686220166] [2025-03-08 22:52:05,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:52:05,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 22:52:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:05,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 22:52:05,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1425, Unknown=5, NotChecked=0, Total=1640 [2025-03-08 22:52:05,659 INFO L87 Difference]: Start difference. First operand 225 states and 272 transitions. Second operand has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:15,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:20,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:23,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:27,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:37,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:39,561 INFO L93 Difference]: Finished difference Result 391 states and 463 transitions. [2025-03-08 22:52:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 22:52:39,562 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 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 42 [2025-03-08 22:52:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:39,563 INFO L225 Difference]: With dead ends: 391 [2025-03-08 22:52:39,563 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 22:52:39,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=744, Invalid=3408, Unknown=8, NotChecked=0, Total=4160 [2025-03-08 22:52:39,564 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1148 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 161 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:39,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1244 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1666 Invalid, 17 Unknown, 0 Unchecked, 24.3s Time] [2025-03-08 22:52:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 22:52:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 229. [2025-03-08 22:52:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 214 states have (on average 1.2897196261682242) internal successors, (276), 228 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 276 transitions. [2025-03-08 22:52:39,567 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 276 transitions. Word has length 42 [2025-03-08 22:52:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:39,567 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 276 transitions. [2025-03-08 22:52:39,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 276 transitions. [2025-03-08 22:52:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:52:39,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:39,569 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 22:52:39,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:52:39,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-08 22:52:39,769 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -298935526, now seen corresponding path program 1 times [2025-03-08 22:52:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251961910] [2025-03-08 22:52:39,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:52:39,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:52:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251961910] [2025-03-08 22:52:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251961910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:52:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92278047] [2025-03-08 22:52:39,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:52:39,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:52:39,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:52:40,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:52:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:52:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:40,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:52:40,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:52:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:40,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:52:40,416 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-08 22:52:40,416 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 30 treesize of output 25 [2025-03-08 22:52:40,422 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-08 22:52:40,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 22:52:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92278047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:52:40,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:52:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-03-08 22:52:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989895252] [2025-03-08 22:52:40,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:52:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:52:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:40,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:52:40,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:52:40,474 INFO L87 Difference]: Start difference. First operand 229 states and 276 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:40,964 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2025-03-08 22:52:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:52:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 22:52:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:40,965 INFO L225 Difference]: With dead ends: 310 [2025-03-08 22:52:40,965 INFO L226 Difference]: Without dead ends: 310 [2025-03-08 22:52:40,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:52:40,966 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 248 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:40,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 652 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:52:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-08 22:52:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 251. [2025-03-08 22:52:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 250 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 304 transitions. [2025-03-08 22:52:40,969 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 304 transitions. Word has length 42 [2025-03-08 22:52:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:40,969 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 304 transitions. [2025-03-08 22:52:40,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 304 transitions. [2025-03-08 22:52:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:52:40,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:40,970 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 22:52:40,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:52:41,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-08 22:52:41,171 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:41,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash -804494151, now seen corresponding path program 1 times [2025-03-08 22:52:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:41,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963368920] [2025-03-08 22:52:41,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:41,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:52:41,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:52:41,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:41,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:52:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963368920] [2025-03-08 22:52:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963368920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 22:52:41,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425837304] [2025-03-08 22:52:41,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:41,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:52:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:41,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:52:41,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:52:41,781 INFO L87 Difference]: Start difference. First operand 251 states and 304 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:42,814 INFO L93 Difference]: Finished difference Result 313 states and 376 transitions. [2025-03-08 22:52:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 22:52:42,814 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 22:52:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:42,815 INFO L225 Difference]: With dead ends: 313 [2025-03-08 22:52:42,815 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 22:52:42,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:52:42,816 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 192 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:42,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 675 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:52:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 22:52:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 278. [2025-03-08 22:52:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 263 states have (on average 1.2775665399239544) internal successors, (336), 277 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2025-03-08 22:52:42,820 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 42 [2025-03-08 22:52:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:42,820 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2025-03-08 22:52:42,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2025-03-08 22:52:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:52:42,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:42,821 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 22:52:42,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:52:42,821 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:42,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1050114334, now seen corresponding path program 1 times [2025-03-08 22:52:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181105158] [2025-03-08 22:52:42,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:52:42,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:52:42,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:42,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181105158] [2025-03-08 22:52:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181105158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:52:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767701545] [2025-03-08 22:52:43,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:52:43,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:52:43,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:52:43,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:52:43,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:52:43,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:43,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 22:52:43,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:52:43,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:52:43,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:52:43,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:52:43,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 22:52:43,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:52:43,611 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-03-08 22:52:43,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:52:43,672 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 58 treesize of output 53 [2025-03-08 22:52:43,677 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 28 treesize of output 11 [2025-03-08 22:52:43,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:52:43,738 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 58 treesize of output 53 [2025-03-08 22:52:43,749 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 28 treesize of output 11 [2025-03-08 22:52:43,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:52:43,799 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 58 treesize of output 53 [2025-03-08 22:52:43,804 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 28 treesize of output 11 [2025-03-08 22:52:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:43,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:52:43,883 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1759 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1761 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1761) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2025-03-08 22:52:43,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_1759 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1761 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1761) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-03-08 22:52:43,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1759)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1761 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1761) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-03-08 22:52:43,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1759)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1761 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1761) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2025-03-08 22:52:43,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1755))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1759)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1761 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1755))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1756) .cse3 v_ArrVal_1757) (select (select (store .cse4 .cse3 v_ArrVal_1758) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1761))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-03-08 22:52:45,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:45,593 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 200 [2025-03-08 22:52:45,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:45,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 157 [2025-03-08 22:52:45,626 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 491 treesize of output 434 [2025-03-08 22:52:45,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 174 [2025-03-08 22:52:45,676 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-08 22:52:45,677 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 2733 treesize of output 2660 [2025-03-08 22:52:45,703 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 324 treesize of output 320 [2025-03-08 22:52:45,710 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 320 treesize of output 288 [2025-03-08 22:52:45,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 284 [2025-03-08 22:52:45,723 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 284 treesize of output 276 [2025-03-08 22:52:45,729 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 276 treesize of output 262 [2025-03-08 22:52:45,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:45,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 293 [2025-03-08 22:52:45,798 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 22:52:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6498 treesize of output 4307 [2025-03-08 22:52:45,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:45,862 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 1149 treesize of output 1096 [2025-03-08 22:52:45,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:45,886 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 1085 treesize of output 920 [2025-03-08 22:52:45,902 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 909 treesize of output 877 [2025-03-08 22:52:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767701545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:52:46,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:52:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 32 [2025-03-08 22:52:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447040682] [2025-03-08 22:52:46,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:52:46,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:52:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:46,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:52:46,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=584, Unknown=15, NotChecked=270, Total=992 [2025-03-08 22:52:46,399 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 32 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:49,427 INFO L93 Difference]: Finished difference Result 410 states and 501 transitions. [2025-03-08 22:52:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:52:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 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 42 [2025-03-08 22:52:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:49,428 INFO L225 Difference]: With dead ends: 410 [2025-03-08 22:52:49,428 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 22:52:49,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=331, Invalid=1233, Unknown=16, NotChecked=400, Total=1980 [2025-03-08 22:52:49,429 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 266 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 974 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:49,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 994 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1094 Invalid, 0 Unknown, 974 Unchecked, 2.2s Time] [2025-03-08 22:52:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 22:52:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 329. [2025-03-08 22:52:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 314 states have (on average 1.2738853503184713) internal successors, (400), 328 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 400 transitions. [2025-03-08 22:52:49,436 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 400 transitions. Word has length 42 [2025-03-08 22:52:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:49,436 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 400 transitions. [2025-03-08 22:52:49,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 400 transitions. [2025-03-08 22:52:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:52:49,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:49,436 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:52:49,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:52:49,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:49,637 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 572075974, now seen corresponding path program 1 times [2025-03-08 22:52:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097963688] [2025-03-08 22:52:49,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:52:49,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:52:49,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:49,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097963688] [2025-03-08 22:52:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097963688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 22:52:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783339984] [2025-03-08 22:52:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:50,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:52:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:50,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:52:50,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:52:50,782 INFO L87 Difference]: Start difference. First operand 329 states and 400 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:52,164 INFO L93 Difference]: Finished difference Result 514 states and 623 transitions. [2025-03-08 22:52:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 22:52:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 22:52:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:52,165 INFO L225 Difference]: With dead ends: 514 [2025-03-08 22:52:52,165 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 22:52:52,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:52:52,166 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 283 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:52,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 794 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 22:52:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 22:52:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 386. [2025-03-08 22:52:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 371 states have (on average 1.2695417789757413) internal successors, (471), 385 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 471 transitions. [2025-03-08 22:52:52,172 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 471 transitions. Word has length 52 [2025-03-08 22:52:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 471 transitions. [2025-03-08 22:52:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 471 transitions. [2025-03-08 22:52:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:52:52,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:52,174 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:52:52,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:52:52,174 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2100382985, now seen corresponding path program 1 times [2025-03-08 22:52:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254985246] [2025-03-08 22:52:52,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:52,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:52:52,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:52:52,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:52,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254985246] [2025-03-08 22:52:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254985246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:53,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:53,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 22:52:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865767079] [2025-03-08 22:52:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:52:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:53,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:52:53,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:52:53,331 INFO L87 Difference]: Start difference. First operand 386 states and 471 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:55,535 INFO L93 Difference]: Finished difference Result 550 states and 674 transitions. [2025-03-08 22:52:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:52:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 22:52:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:55,536 INFO L225 Difference]: With dead ends: 550 [2025-03-08 22:52:55,536 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 22:52:55,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 22:52:55,537 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 421 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:55,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 787 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 22:52:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 22:52:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 499. [2025-03-08 22:52:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 484 states have (on average 1.2830578512396693) internal successors, (621), 498 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2025-03-08 22:52:55,542 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 52 [2025-03-08 22:52:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2025-03-08 22:52:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:52:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2025-03-08 22:52:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 22:52:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:55,543 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:52:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 22:52:55,543 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2025-03-08 22:52:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 96196229, now seen corresponding path program 1 times [2025-03-08 22:52:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144207171] [2025-03-08 22:52:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:55,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:52:55,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:52:55,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:55,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:52:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144207171] [2025-03-08 22:52:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144207171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:52:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612715761] [2025-03-08 22:52:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:56,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:56,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:52:56,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:52:56,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:52:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:52:56,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:52:56,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:56,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:56,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 22:52:56,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:52:56,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:52:56,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:52:57,033 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-03-08 22:52:57,215 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 22:52:57,215 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 28 treesize of output 22 [2025-03-08 22:52:57,481 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-03-08 22:52:57,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 38 [2025-03-08 22:52:57,744 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:52:57,745 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